#include <iostream>
#include<queue>
using namespace std;
int n;
double x, y, ans, c;
priority_queue<double> pq, pq2;
int main() {
cin >> n;
while(n--){
cin >> x >> y;
pq.push(x); pq2.push(y);
//cout << x << ' ' << y << endl;
}
x=y=0;
while(1){
if (x<y){
if (pq.empty()) break;
x+=pq.top(); pq.pop();
} else {
if (pq2.empty()) break;
y+=pq2.top(); pq2.pop();
}
c++;
//cout << x << ' ' << y << ' ' << c << endl;
ans=max(min(x, y)-c, ans);
}
printf("%.4lf", ans);
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
2016 KB |
Output is correct |
2 |
Correct |
0 ms |
2016 KB |
Output is correct |
3 |
Correct |
0 ms |
2016 KB |
Output is correct |
4 |
Correct |
0 ms |
2016 KB |
Output is correct |
5 |
Correct |
0 ms |
2016 KB |
Output is correct |
6 |
Correct |
0 ms |
2016 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
2016 KB |
Output is correct |
2 |
Correct |
0 ms |
2016 KB |
Output is correct |
3 |
Correct |
0 ms |
2016 KB |
Output is correct |
4 |
Correct |
0 ms |
2016 KB |
Output is correct |
5 |
Correct |
0 ms |
2016 KB |
Output is correct |
6 |
Correct |
0 ms |
2016 KB |
Output is correct |
7 |
Correct |
0 ms |
2016 KB |
Output is correct |
8 |
Correct |
0 ms |
2016 KB |
Output is correct |
9 |
Correct |
0 ms |
2016 KB |
Output is correct |
10 |
Correct |
0 ms |
2016 KB |
Output is correct |
11 |
Correct |
0 ms |
2016 KB |
Output is correct |
12 |
Correct |
0 ms |
2016 KB |
Output is correct |
13 |
Correct |
3 ms |
2016 KB |
Output is correct |
14 |
Correct |
0 ms |
2016 KB |
Output is correct |
15 |
Correct |
0 ms |
2016 KB |
Output is correct |
16 |
Correct |
0 ms |
2016 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
2016 KB |
Output is correct |
2 |
Correct |
0 ms |
2016 KB |
Output is correct |
3 |
Correct |
0 ms |
2016 KB |
Output is correct |
4 |
Correct |
0 ms |
2016 KB |
Output is correct |
5 |
Correct |
0 ms |
2016 KB |
Output is correct |
6 |
Correct |
0 ms |
2016 KB |
Output is correct |
7 |
Correct |
0 ms |
2016 KB |
Output is correct |
8 |
Correct |
0 ms |
2016 KB |
Output is correct |
9 |
Correct |
0 ms |
2016 KB |
Output is correct |
10 |
Correct |
0 ms |
2016 KB |
Output is correct |
11 |
Correct |
0 ms |
2016 KB |
Output is correct |
12 |
Correct |
0 ms |
2016 KB |
Output is correct |
13 |
Correct |
3 ms |
2016 KB |
Output is correct |
14 |
Correct |
0 ms |
2016 KB |
Output is correct |
15 |
Correct |
0 ms |
2016 KB |
Output is correct |
16 |
Correct |
0 ms |
2016 KB |
Output is correct |
17 |
Correct |
189 ms |
4664 KB |
Output is correct |
18 |
Correct |
169 ms |
4664 KB |
Output is correct |
19 |
Correct |
196 ms |
4664 KB |
Output is correct |
20 |
Correct |
176 ms |
4664 KB |
Output is correct |
21 |
Correct |
203 ms |
4664 KB |
Output is correct |
22 |
Correct |
159 ms |
4664 KB |
Output is correct |
23 |
Correct |
183 ms |
4664 KB |
Output is correct |
24 |
Correct |
199 ms |
4664 KB |
Output is correct |
25 |
Correct |
179 ms |
4664 KB |
Output is correct |
26 |
Correct |
206 ms |
4664 KB |
Output is correct |