Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 4723 | Accepted: 1892 |
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 Ti minutes (1 ≤ Ti ≤ 2,000,000) away from its own barn. Furthermore, while waiting for transport, she destroys Di (1 ≤ Di ≤ 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 × Ti minutes (Ti to get there and Ti 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
Lines 2.. N+1: Each line contains two space-separated integers, Ti and Di, that describe a single cow's characteristics
Output
Sample Input
6 3 1 2 5 2 3 3 2 4 1 1 6
Sample Output
86
对于(t1,c1) (t2,c2) 两只cow 赶1造成的损失t1*c2 赶2损失t2*c1 那么只要按照这个排序即可
AC代码如下:
//
// POJ 3262 Protecting the Flowers
//
// Created by TaoSama on 2015-02-22
// Copyright (c) 2015 TaoSama. All rights reserved.
//
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <set>
#include <vector>
#define CLR(x,y) memset(x, y, sizeof(x))
using namespace std;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const int N = 1e5 + 10;
int n;
struct ACM {
int t, c;
bool operator<(const ACM& r) const {
return t * r.c > r.t * c;
//(t1,c1) (t2,c2) 赶1造成的损失t1*c2 赶2损失t2*c1
}
} a[N];
int main() {
#ifdef LOCAL
freopen("in.txt", "r", stdin);
// freopen("out.txt","w",stdout);
#endif
ios_base::sync_with_stdio(0);
while(cin >> n) {
for(int i = 1; i <= n; ++i) cin >> a[i].t >> a[i].c;
sort(a + 1, a + 1 + n);
long long ans = 0, sum = 0;
for(int i = 1; i <= n; ++i) {
ans += 2LL * a[i].t * sum;
sum += a[i].c;
}
cout << ans << endl;
}
return 0;
}