hdu 4070 福州赛区网络赛J 贪心 ***

优先发路程最长的

 #include<cstdio>
 #include<iostream>
 #include<algorithm>
 #include<cstring>
 #include<cmath>
 #include<queue>
 #include<map>
 using namespace std;
 #define MOD 1000000007
 const int INF=0x3f3f3f3f;
 const double eps=1e-;
 typedef long long ll;
 #define cl(a) memset(a,0,sizeof(a))
 #define ts printf("*****\n");
 const int MAXN=;
 int n,m,tt;
 struct Node
 {
     int num,t;
 }node[MAXN];
 bool cmp(Node a,Node b)
 {
     return a.t>b.t;
 }
 int main()
 {
     int i,j,k,ca=;
     #ifndef ONLINE_JUDGE
     freopen("1.in","r",stdin);
     #endif
     scanf("%d",&tt);
     while(tt--)
     {
         printf("Case %d: ",ca++);
         scanf("%d",&n);
         for(i=;i<n;i++)
         scanf("%d%d",&node[i].num,&node[i].t);
         sort(node,node+n,cmp);
         int sum=;
         int Max=;
         int tot=;
         for(i=;i<n;i++)
         {
             sum=node[i].num+node[i].t-+tot;
             Max=max(sum,Max);
             tot+=node[i].num;

         }
         printf("%d\n",Max+);
     }
 }