水 贪心，主要用下STL
#include<iostream> #include<cstdio> #include<cmath> #include<cstring> #include<string> #include<algorithm> #include<stack> #include<queue> #include<cctype> #include<functional> using namespace std; #define swap(a,b) {long long c=a;a=b;b=c;} const int MAX = 999999; const double Eps = 1e-12; const double PI = acos(-1.0); int gcd(int x, int y) { return x%y == 0 ? y : gcd(y, x%y); } struct node { int a, b; bool operator<(const node& x) const { return b > x.b; } }p; int main() { int t; int k = 1; while (cin>>t &&t) { int i, j; vector<node> v; for(i=0;i<t;i++) { cin >> p.a >> p.b; v.push_back(p); } sort(v.begin(), v.end()); int s = 0; int ans = 0; // for (i = 0; i < v.size(); i++) // { // cout << v[i].a << " " << v[i].b << endl; //} for (i = 0; i < v.size(); i++) { s += v[i].a; ans = max(ans, s + v[i].b); } printf("Case %d: %d\n", k++, ans); } return 0; }