Submission #853618

# Submission time Handle Problem Language Result Execution time Memory
853618 2023-09-24T17:56:18 Z mbfibat Sure Bet (CEOI17_sure) C++17
100 / 100
71 ms 2236 KB
#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 11;
double a[N], b[N];

int main(int argc, char** argv) {
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);

	int n; cin >> n;
	for (int i = 1; i <= n; i++)
		cin >> a[i] >> b[i];
	sort(a + 1, a + 1 + n, greater<double>());
	sort(b + 1, b + 1 + n, greater<double>());

	double ans = 0.0;

	int pos_a = 1, pos_b = 1, cnt = 0;
	double sum_a = 0, sum_b = 0;
	while (1) {
		++cnt;
		if (sum_a < sum_b) {	
			if (pos_a > n) break;
			sum_a += a[pos_a++];
		} else if (sum_b < sum_a) {
			if (pos_b > n) break;
			sum_b += b[pos_b++];
		} else {
			if (sum_a > n || sum_b > n) break;
			sum_a += a[pos_a++];
		}
		double val = min(sum_a - cnt, sum_b - cnt);
		ans = max(ans, val);
	}

	cout << setprecision(4) << fixed << ans;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 56 ms 1872 KB Output is correct
18 Correct 57 ms 1872 KB Output is correct
19 Correct 59 ms 2212 KB Output is correct
20 Correct 62 ms 1876 KB Output is correct
21 Correct 60 ms 2236 KB Output is correct
22 Correct 58 ms 1872 KB Output is correct
23 Correct 57 ms 1876 KB Output is correct
24 Correct 57 ms 1872 KB Output is correct
25 Correct 62 ms 1872 KB Output is correct
26 Correct 71 ms 1872 KB Output is correct