uva11729 Commando War

\Waiting for orders we held in the wood, word from the front never
came By evening the sound of the gun re was miles away Ah softly we
moved through the shadows, slip away through the trees Crossing their
lines in the mists in the elds on our hands and our knees And all
that I ever, was able to see The re in the air, glowing red,
silhouetting the smoke on the breeze” There is a war and it doesn’t
look very promising for your country. Now it’s time to act. You have a
commando squad at your disposal and planning an ambush on an important
enemy camp located nearby. You have N soldiers in your squad. In your
master-plan, every single soldier has a unique responsibility and you
don’t want any of your soldier to know the plan for other soldiers so
that everyone can focus on his task only. In order to enforce this,
you brief every individual soldier about his tasks separately and just
before sending him to the battle eld. You know that every single
soldier needs a certain amount of time to execute his job. You also
know very clearly how much time you need to brief every single
soldier. Being anxious to nish the total operation as soon as
possible, you need to nd an order of brie ng your soldiers that will
minimize the time necessary for all the soldiers to complete their
tasks. You may assume that, no soldier has a plan that depends on the
tasks of his fellows. In other words, once a soldier begins a task, he
can nish it without the necessity of pausing in between. Input There
will be multiple test cases in the input le. Every test case starts
with an integer N (1 N 1000), denoting the number of soldiers.
Each of the following N lines describe a soldier with two integers B
(1 B 10000) & J (1 J 10000). B seconds are needed to brief the
soldier while completing his job needs J seconds. The end of input
will be denoted by a case with N
= 0. This case should not be processed. Output For each test case, print a line in the format, ` Case X : Y ‘, where X is the case number
& Y is the total number of seconds counted from the start of your rst
brie ng till the completion of all jobs.

考虑邻项交换，对于两个任务[bi,ji]，[b(i+1),j(i+1)]，交换他们两个对其他任务的时间都没有影响。如果交换之前i比i+1后完成的话，当然不应该交换。如果i先完成，那么交换前总时间bi+b(i+1)+j(i+1)，交换后总时间max(b(i+1)+j(i+1),b(i+1)+bi+ji)。因为前一项一定比原式小，要让交换后没有原来优，只需要j(i+1)

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
struct sold
{
    int b,j;
    bool operator < (const sold & ss) const
    {
        return j>ss.j;
    }
}a[1010];
int n;
int main()
{
    int i,now,ans,K=0;
    while (scanf("%d",&n)&&n)
    {
        for (i=1;i<=n;i++)
          scanf("%d%d",&a[i].b,&a[i].j);
        sort(a+1,a+n+1);
        ans=now=0;
        for (i=1;i<=n;i++)
        {
            now+=a[i].b;
            ans=max(ans,now+a[i].j);
        }
        printf("Case %d: %d\n",++K,ans);
    }
}