UVa - 11729 - Commando War ( 排序+贪心 )

#include<cstdio>
#include<algorithm>
#define N 1001
using namespace std;
struct Soldier{
	int a,b;
}s[N];

bool cmp(Soldier s1 ,Soldier s2){
	return s1.b>s2.b;
}

int cnt = 0;
int a,b,n;
int main(){
	while(scanf("%d",&n)!=EOF&&n){
		cnt++;
		for(int i=0 ;i<n ;i++) scanf("%d%d",&s[i].a,&s[i].b);
		sort(s,s+n,cmp);
		int ans = 0;
		int temp = 0;
		for(int i=0 ;i<n ;i++){
			temp += s[i].a;
			ans = max(ans,temp+s[i].b);
		}
		printf("Case %d: %d\n",cnt,ans);
	}
	
	return 0;
}