POJ 3262-Protecting the Flowers（贪心+前缀和）

N - Protecting the Flowers

Time Limit:2000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u

Submit Status Practice POJ 3262

Appoint description: System Crawler  (2016-05-04)

Description

Farmer John went to cut some wood and left N (2 ≤ N ≤ 100,000) cows eating the grass, as usual. When he returned, he found to his horror that the cluster of cows was in his garden eating his beautiful flowers. Wanting to minimize the subsequent damage, FJ decided to take immediate action and transport each cow back to its own barn.

Each cow i is at a location that is T_i minutes (1 ≤ T_i ≤ 2,000,000) away from its own barn. Furthermore, while waiting for transport, she destroysD_i (1 ≤ D_i ≤ 100) flowers per minute. No matter how hard he tries, FJ can only transport one cow at a time back to her barn. Moving cow i to its barn requires 2 × T_i minutes (T_i to get there and T_i to return). FJ starts at the flower patch, transports the cow to its barn, and then walks back to the flowers, taking no extra time to get to the next cow that needs transport.

Write a program to determine the order in which FJ should pick up the cows so that the total number of flowers destroyed is minimized.

Input

Line 1: A single integer N
Lines 2.. N+1: Each line contains two space-separated integers, T_i and D_i, that describe a single cow's characteristics

Output

Line 1: A single integer that is the minimum number of destroyed flowers

Sample Input

63 12 52 33 24 11 6

Sample Output

86

Hint

FJ returns the cows in the following order: 6, 2, 3, 4, 1, 5. While he is transporting cow 6 to the barn, the others destroy 24 flowers; next he will take cow 2, losing 28 more of his beautiful flora. For the cows 3, 4, 1 he loses 16, 12, and 6 flowers respectively. When he picks cow 5 there are no more cows damaging the flowers, so the loss for that cow is zero. The total flowers lost this way is 24 + 28 + 16 + 12 + 6 = 86.

AC代码：

/*这题其实就是说有n头牛，分别要用t分钟运走，而在这些时间之内还在原位置的牛会搞破坏，所以就直接用破坏/时间来衡量破坏度，再按破坏度由大到小排序就会是最小破坏了。*/#include<iostream>#include<algorithm>#include<cstring>#include<string>#include<cstdio>#include<cmath>#include<ctime>#include<cstdlib>#include<queue>#include<vector>#include<set>using namespace std;const int T=155000;#define inf 0x3f3f3f3fLtypedef long long ll;struct node{int t,d;double v;node(){}node(int _t,int _d,int _v):t(_t),d(_d),v(_v){}bool operator<(const node& a)const{return v>a.v;}}a[T];ll s[T];int main(){#ifdef zscfreopen("input.txt","r",stdin);#endifint n,m,i,j,k;ll sum = 0;while(~scanf("%d",&n)){sum = 0;memset(s,0,sizeof(s));for(i=0;i<n;++i){scanf("%d%d",&a[i].t,&a[i].d);a[i].v = a[i].d*1.0/a[i].t;}sort(a,a+n);for(i=n-1;i>=0;--i){s[i] = s[i+1]+a[i].d;}for(i=0;i<n;++i){sum += 2*a[i].t*(s[i]-a[i].d);}printf("%lld\n",sum);}return 0;}