http://poj.org/problem?id=2751
贪心策略见cmp函数,简单来说就是使得s1的作业及你快完成,以便尽快转到s2,注意s1没有空闲时间,而s2可能有空闲时间
#define N 10005
struct node{
int s1,s2;
}p[N];
/*
bool cmp(node a,node b){
if(a.s1!=b.s1)return a.s1<b.s1;
return a.s2>b.s2;
}*/
bool cmp(node x,node y){
if (x.s1<x.s2&&y.s1>=y.s2) return true;
if (x.s1<x.s2&&y.s1<y.s2) return x.s1<y.s1;
if (x.s1>=x.s2&&y.s1>=y.s2) return x.s2>y.s2;//!!!
return false;
}
int main(){
int n;
while(scanf("%d",&n) &&n){
int i,j;
for(i=0;i<n;i++){
scanf("%d%d",&p[i].s1,&p[i].s2);
}
sort(p,p+n,cmp);
for(i=0;i<n;i++){
cout<<p[i].s1<<" "<<p[i].s2<<endl;
}
int t1=0,t2=0;
for(i=0;i<n;i++){
t1 += p[i].s1;
t2 = max(t1,t2) + p[i].s2;
cout<<t1<<"~"<<t2<<endl;
}
printf("%d\n",t2);
}
return 0;
}