uva11729----Commando War

#include<stdio.h>#include<algorithm>using namespace std;struct node{    int j,b;}a[1005];int cmp(node a,node b){    return a.j>b.j;}int main(){    int n,cas=1;    while(scanf("%d",&n)&&n)    {        for(int i=0;i<n;i++)            scanf("%d%d",&a[i].b,&a[i].j);        sort(a,a+n,cmp);        int s=0;        int ans=0;        for(int i=0;i<n;i++){            s+=a[i].b;//当前时间            ans=max(ans,s+a[i].j);//最后结束时间        }        printf("Case %d: %d\n",cas++,ans);    }    return 0;}