（三维矩形混凝土空间的复杂堆砌）Buildings

题目描述

　Have you ever heard the story of Blue.Mary, the great civil engineer? Unlike Mr. Wolowitz, Dr. Blue.Mary has accomplished many great projects, one of which is the Guanghua Building.
　　The public opinion is that Guanghua Building is nothing more than one of hundreds of modern skyscrapers recently built in Shanghai, and sadly, they are all wrong. Blue.Mary the great civil engineer had try a completely new evolutionary building method in project of Guanghua Building. That is, to build all the floors at first, then stack them up forming a complete building.
　　Believe it or not, he did it (in secret manner). Now you are face the same problem Blue.Mary once stuck in: Place floors in a good way.
　　Each floor has its own weight wi and strength si. When floors are stacked up, each floor has PDV(Potential Damage Value) equal to (Σwj)-si, where (Σwj) stands for sum of weight of all floors above.
　　Blue.Mary, the great civil engineer, would like to minimize PDV of the whole building, denoted as the largest PDV of all floors.
　　Now, it’s up to you to calculate this value.

 

输入

　There’re several test cases.
In each test case, in the first line is a single integer N (1 <= N <= 105) denoting the number of building’s floors. The following N lines specify the floors. Each of them contains two integers wi and si (0 <= wi, si <= 100000) separated by single spaces.
Please process until EOF (End Of File).

 

输出

For each test case, your program should output a single integer in a single line - the minimal PDV of the whole building.
　　If no floor would be damaged in a optimal configuration (that is, minimal PDV is non-positive) you should output 0.

 

样例输入

copy

3
10 6
2 3
5 4
2
2 2
2 2
3
10 3
2 5
3 3

样例输出

1
0
2

#include<iostream>
#include<algorithm>
using namespace std;
struct minpdv
{
    int w,s;
}pdv[100001];
bool cmp(minpdv a,minpdv b)
{///从小到大排序
    if(a.w!=b.w)return a.w<b.w;
}
int main()
{
    int n;
    while(cin>>n&&n)
    {
        for(int i=0;i<n;i++)
            cin>>pdv[i].w>>pdv[i].s;
        sort(pdv,pdv+n,cmp);
        int sum=0;
        for(int i=0;i<n-1;i++)
            sum+=pdv[i].w;///最后一个之前的pdv的w求和
        cout<<sum-pdv[n-1].s<<endl;///减去最后一个就是最小的了
    }
}