UVa 11729

#include<cstdio> //#include<iostream>#include<algorithm>using namespace std;#define N 1010struct node{  int b,j;       }a[N];int cmp(node a,node b){  return a.j>b.j;    }int main(){    int n,i;    int Case=0;    while(scanf("%d",&n)!=EOF)    {        if(n==0)          break;                  for(i=0;i<n;i++)          scanf("%d%d",&a[i].b,&a[i].j);         sort(a,a+n,cmp);      // for(i=0;i<n;i++)      //   printf("%d%d\n",a[i].b,a[i].j);              int totletime=0;      int ans=0;      for(i=0;i<n;i++)      {        totletime+=a[i].b;        ans=max(ans,totletime+a[i].j);      }     printf("Case %d: %d\n",++Case,ans);                                                             }            return 0;    }