UVa11729 Commando War

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=117&page=show_problem&problem=2829看了lrj的书感觉学到了不少知识。比如这道题的运算符重载，以前我都不是这么写的，还有vector的用法

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<vector>
#include<cmath>
#include<stdlib.h>
#include<iomanip>
#include<list>
#include<deque>
#include<map>
#include <stdio.h>
#include <queue>
#define maxn 10000+5
#define ull unsigned long long
#define ll long long
#define reP(i,n) for(i=1;i<=n;i++)
#define rep(i,n) for(i=0;i<n;i++)
#define cle(a) memset(a,0,sizeof(a))
#define mod 90001
#define PI 3.141592657
#define INF 1<<30
const ull inf = 1LL << 61;
const double eps=1e-5;

using namespace std;

bool cmp(int a,int b){
return a>b;
}
struct Job
{
int j,b;
bool operator <(const Job& x)const{
return j>x.j;
}
};
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
int n,b,j,kase=1;
while(scanf("%d",&n)==1&&n)
{
vector<Job>v;
for(int i=0;i<n;i++)
{
scanf("%d%d",&b,&j);v.push_back((Job){j,b});
}
sort(v.begin(),v.end());
int s=0;
int ans=0;
for(int i=0;i<n;i++)
{
s+=v[i].b;
ans=max(ans,s+v[i].j);
}
printf("Case %d: %d\n",kase++,ans);
}
return 0;
}