uva11729 - Commando War（贪心）

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<cmath>
#include<map>
#include<set>
#include<vector>
#include<algorithm>
#include<stack>
#include<queue>
#include<cctype>
#include<sstream>
using namespace std;
#define pii pair<int,int>
#define LL long long int
const int eps=1e-8;
const int INF=1000000000;
const int maxn=1000+10;
struct node
{
    int B,J;
}a[maxn];
int n,ans,cas=0;
bool cmp(node x,node y)
{
    return x.J>y.J;
}
int main()
{
    //freopen("in2.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    while(scanf("%d",&n)==1&&n)
    {
        for(int i=0;i<n;i++)
        {
            scanf("%d%d",&a[i].B,&a[i].J);
        }
        sort(a,a+n,cmp);
        ans=a[0].B+a[0].J;
        int t=a[0].B+a[0].J;
        for(int i=1;i<n;i++)
        {
            t+=a[i].B+a[i].J-a[i-1].J;//t表示每一“横条”的用时
            ans=max(ans,t);

        }
        printf("Case %d: %d\n",++cas,ans);
    }
    //fclose(stdin);
    //fclose(stdout);
    return 0;
}