uva 11729 - Commando War

水题怡情

#include<cstdio>
#include<algorithm>
#define maxn 1005
using namespace std;
struct war
{
    int a,b;
    bool operator<(const war &t)const
    {
        return b>t.b;
    }
}wa[maxn];

int main()
{
    int n,ca=1;
    while(scanf("%d",&n)&&n)
    {
        for(int i=0;i<n;i++)scanf("%d%d",&wa[i].a,&wa[i].b);
        sort(wa,wa+n);
        int ans=0,cur=0;
        for(int i=0;i<n;i++)
        {
            cur+=wa[i].a;
            ans=max(ans,cur+wa[i].b);
        }
        printf("Case %d: %d\n",ca++,ans);
    }
    return 0;
}