45105
56 94
38 17
45 46
94 65
42 77
4 31
71 51
49 31
82 9
11 62
33 30
50 19
52 61
32 8
<308494 bytes omitted>用户输出
1349072953962系统信息
Exited with return code 0| 编号 | 题目 | 状态 | 分数 | 总时间 | 内存 | 代码 / 答案文件 | 提交者 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| #21890 | #1022. jwp的排队难题 | Accepted | 100 | 60 ms | 1876 K | C++ / 601 B | jzl20021114 | 2020-02-10 19:57:21 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
class People {
public:
ll anger, time;
People(ll m, ll n) : anger(m), time(n) {}
People() {}
friend bool operator<(const People& A, const People& B) { return (B.anger * A.time < A.anger * B.time); }
};
const int MAX = 1e6 + 5;
People people[MAX];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
scanf("%d %d", &people[i].anger, &people[i].time);
}
sort(people + 1, people + 1 + n);
ll r = 0, l = 0;
for (int i = 1; i <= n; i++) {
r += people[i].time;
l += people[i].anger * r;
}
cout << l;
return 0;
}45105
56 94
38 17
45 46
94 65
42 77
4 31
71 51
49 31
82 9
11 62
33 30
50 19
52 61
32 8
<308494 bytes omitted>用户输出
1349072953962系统信息
Exited with return code 06667
81 6
83 71
57 69
97 27
5 84
20 77
28 77
77 57
97 49
40 18
78 39
41 69
14 11
99 1
<45515 bytes omitted>用户输出
29669490408系统信息
Exited with return code 055457
60 47
63 7
81 14
91 88
2 83
4 35
80 77
55 46
97 57
65 10
56 14
15 43
88 3
19 62
<379227 bytes omitted>用户输出
2046293880925系统信息
Exited with return code 054839
31 85
77 24
87 83
9 18
35 74
88 40
59 14
47 63
50 31
17 40
1 23
71 10
43 69
24 1
<374961 bytes omitted>用户输出
1999020249779系统信息
Exited with return code 0