hdu4296 Buildings 贪心

Description

　　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 w  _i and strength s  _i. When floors are stacked up, each floor has PDV(Potential Damage Value) equal to (Σw  _j)-s  _i, where (Σw  _j) 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. 

 

Input

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

 

Output

　　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. 

 

Sample Input

       
       

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

 

Sample Output

       
       

        
         1
0
2 
       
       

 

真的是一道贪心水题，但是读题读了好长时间。这道题目的意思是告诉你一栋楼把所有的地板放在一块每层地板都有自己的wi和si就是重量和承受的力量。每层都有PDV就是它上面的所有地板的重量和减去本层地板的承受的重量其实就是算上本层地板的所有重量减去本层的重量加上承受能力这样的话w+s越大的放在下面真个楼的PDV的最大值最小，让你求这个最小值，如果最小值小于0那么输出〇。

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
struct node
{
    __int64 w,si,s;
}q[100010];
int cmp(struct node a,struct node b)
{
    return a.s<b.s;
}
int main()
{
   int n;
   while(~scanf("%I64d",&n))
   {
       for(int i=0;i<n;i++)
       {
           scanf("%I64d %I64d",&q[i].w,&q[i].si);
           q[i].s=q[i].w+q[i].si;
       }
       sort(q,q+n,cmp);
       __int64 sum=0;
       sum=q[0].w;
       __int64 ans=0;
       for(int i=1;i<n;i++)
       {
           sum+=q[i].w;
           ans=sum-q[n-1].s;
       }
       if(ans>0)
        printf("%I64d\n",ans);
       else
        printf("0\n");
   }
   return 0;
}