51nod 1099 Task Execution order (greedy algorithm)

Title: Portal.

Test instructions: Chinese question.

R[i]-o[i] Advanced lines with large values. The counter-proof method: If the big later, will cause the space to increase, so a certain big is first.

#include <iostream>#include<cstdio>#include<cmath>#include<cstring>#include<algorithm>using namespaceStd;typedefLong Longll;structsa{ll R,o,c;} data[100005];BOOLCMP (sa X,sa y)//Note that this sort method has a large difference in the advanced line{    returnX.c>y.c;}intMain () {ll n;  while(cin>>N) { for(intI=0; i<n; i++) {cin>>data[i].r>>data[i].o;//Note (O[i]<r[i]) This is important .data[i].c=data[i].r-DATA[I].O; } sort (Data,data+n,cmp); ll ans=0, tmp=0;  for(intI=0; i<n; i++) {ans=max (ans,tmp+DATA[I].R); TMP+=DATA[I].O; } cout<<ans<<Endl; }    return 0;}

51nod 1099 Task Execution order (greedy algorithm)