显示代码纯文本
#include <iostream>
#include <cstdio>
#include <climits>
#include <cmath>
#include <cstring>
#include <algorithm>
using namespace std;
struct node{
int b,j;
}a[1010];
int n,cnt,ci,ans;
bool cmp(node i,node j){
return i.j>j.j;
}
int main()
{
freopen ("commando.in","r",stdin);
freopen ("commando.out","w",stdout);
while (scanf("%d",&n)==1 && n)
{
cnt=0; ans=0; ci++;
for (int i=1; i<=n; i++)
scanf("%d%d",&a[i].b,&a[i].j);
sort(a+1,a+n+1,cmp);
for (int i=1; i<=n; i++)
{
cnt+=a[i].b;
ans=max(ans,cnt+a[i].j);
}
printf("Case %d: %d\n",ci,ans);
}
return 0;
}