답안 #158514

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
158514	2019-10-17T13:40:30 Z	dolphingarlic	Sure Bet (CEOI17_sure)	C++14	60 / 100	191 ms	3364 KB

sure

#include <bits/stdc++.h>
using namespace std;
 
double a[100000], b[100000];
 
int main() {
	int n;
	cin >> n;
	for (int i = 0; i < n; i++) cin >> a[i] >> b[i];
	sort(a, a + n, greater<double>());
	sort(b, b + n, greater<double>());
 
	double ans = 0, l = 0, r = 0;
	int lptr = 0, rptr = 0;
	for (int i = 1; i <= 2 * n; i++) {
		if (rptr == n || l < r) l += a[lptr++];
		else r += b[rptr++];
		ans = max(ans, min(l, r) - i);
	}
 
	cout << fixed << setprecision(4) << ans;
	return 0;
}

Subtask #1

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	504 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	256 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct

Subtask #2

40.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	504 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	256 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	256 KB	Output is correct
8	Correct	2 ms	256 KB	Output is correct
9	Correct	2 ms	256 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	256 KB	Output is correct
12	Correct	4 ms	376 KB	Output is correct
13	Correct	4 ms	376 KB	Output is correct
14	Correct	4 ms	376 KB	Output is correct
15	Correct	4 ms	376 KB	Output is correct
16	Correct	4 ms	376 KB	Output is correct

Subtask #3

0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	504 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	256 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	256 KB	Output is correct
8	Correct	2 ms	256 KB	Output is correct
9	Correct	2 ms	256 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	256 KB	Output is correct
12	Correct	4 ms	376 KB	Output is correct
13	Correct	4 ms	376 KB	Output is correct
14	Correct	4 ms	376 KB	Output is correct
15	Correct	4 ms	376 KB	Output is correct
16	Correct	4 ms	376 KB	Output is correct
17	Correct	190 ms	3220 KB	Output is correct
18	Correct	190 ms	3296 KB	Output is correct
19	Correct	191 ms	3364 KB	Output is correct
20	Incorrect	190 ms	3316 KB	Output isn't correct
21	Halted	0 ms	0 KB	-