답안 #491012

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
491012	2021-11-30T03:43:22 Z	hollwo_pelw	Sure Bet (CEOI17_sure)	C++17	60 / 100	87 ms	3528 KB

sure

#include <bits/stdc++.h>
using namespace std;

const int N = 1e5 + 5;

// #define int long long
int n;
long double a[N], b[N], suma, sumb, res;

signed main() {
	cin.tie(0), cout.tie(0) -> sync_with_stdio(0);
	cin >> n;
	for (int i = 1; i <= n; i++) {
	    cin >> a[i] >> b[i];
	}
	sort(a + 1, a + n + 1, greater<long double>());
	sort(b + 1, b + n + 1, greater<long double>());
	
	int pa = 0, pb = 0;
	for (int i = 1; i <= 2 * n; i++) {
	    if (suma < sumb && pa < n)
	        suma += a[++ pa];
	    else
	        sumb += b[++ pb];
	    res = max(res, min(suma, sumb) - i);
	}
	cout << fixed << setprecision(4) << res;
}

Subtask #1

20.0 / 20.0

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

Subtask #2

40.0 / 40.0

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

Subtask #3

0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	332 KB	Output is correct
2	Correct	0 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	0 ms	332 KB	Output is correct
5	Correct	0 ms	332 KB	Output is correct
6	Correct	0 ms	332 KB	Output is correct
7	Correct	0 ms	332 KB	Output is correct
8	Correct	0 ms	332 KB	Output is correct
9	Correct	0 ms	332 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	0 ms	332 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	2 ms	332 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	76 ms	3436 KB	Output is correct
18	Correct	78 ms	3380 KB	Output is correct
19	Correct	80 ms	3336 KB	Output is correct
20	Correct	78 ms	3388 KB	Output is correct
21	Incorrect	87 ms	3528 KB	Output isn't correct
22	Halted	0 ms	0 KB	-