UVa - 11729 Commando War

题解：

代码：

#include<cstdio>
#include<algorithm>
using namespace std;
struct Q{int a,b;}q[10000*5];
bool cmp(const Q& A,const Q& B){return A.b>B.b;}
int main(){int cur=0,n;
while(scanf("%d",&n)!=EOF&&n){int maxn=0,beg=0;
for(register int i=1;i<=n;i++)scanf("%d%d",&q[i].a,&q[i].b);
sort(q+1,q+n+1,cmp);
for(register int i=1;i<=n;i++)beg+=q[i].a,maxn=max(beg+q[i].b,maxn);
printf("Case %d: %d\n",++cur,maxn);
}
return 0;
}