Commando War UVA - 11729

比较简单的一道题目，这道题目通过分析可以发现使用贪心算法求解即可，也就是我们要将执行时间长的任务尽量先做然后再完成那些执行时间短的任务即可，具体实现见如下代码：

#include<iostream>
#include<vector>
#include<string>
#include<set>
#include<stack>
#include<queue>
#include<map>
#include<unordered_map>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<cstring>
#include<sstream>
#include<cstdio>
#include<deque>
#include<functional>
#include<utility>
using namespace std;

int Case,N;

struct node{
	int tell, excute;
	int sum;
};

bool compare(const node a,const node b){
	return a.excute > b.excute;
}

int main(){
	Case = 0;
	while (cin >> N){
		Case++;
		if (N == 0) break;
		vector<node> v;
		for (int i = 0; i < N; i++){
			node temp;
			cin >> temp.tell >> temp.excute;
			temp.sum = temp.tell + temp.excute;
			v.push_back(temp);
		}
		sort(v.begin(),v.end(),compare);
		int cur = v[0].sum, tell = v[0].tell;
		for (int i = 1; i < N; i++){
			tell += v[i].tell;
			if (tell + v[i].excute>cur) cur = tell + v[i].excute;
		}
		cout << "Case " << Case << ": "<<cur<<endl;
	} 
	return 0;
}