oj.uz

Submission #964605

# Submission time Handle Problem Language Result Execution time Memory
964605 2024-04-17T07:48:17 Z Trisanu_Das Sure Bet (CEOI17_sure) C++17
100 / 100
 66 ms 3740 KB 
#include <bits/stdc++.h>
using namespace std;
 
const int mxN=1e5;
int n;
double a[mxN+1], b[mxN+1], ans, sa, sb;
 
int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	cin >> n;
	for(int i=0; i<n; ++i)
		cin >> a[i] >> b[i];
	sort(a, a+n+1);
	sort(b, b+n+1);
	for(int i1=n, i2=n; i1>=0&&i2>=0; ) {
		if(sa<sb) sa += a[i1--];
		else sb += b[i2--];
		ans=max(min(sa, sb) - (n - i1) - (n-i2), ans);
	}
	cout << fixed << setprecision(4) << ans;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 472 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 472 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 63 ms 3364 KB Output is correct
18 Correct 56 ms 3368 KB Output is correct
19 Correct 56 ms 3168 KB Output is correct
20 Correct 61 ms 3364 KB Output is correct
21 Correct 59 ms 3664 KB Output is correct
22 Correct 66 ms 3288 KB Output is correct
23 Correct 57 ms 3408 KB Output is correct
24 Correct 55 ms 3180 KB Output is correct
25 Correct 56 ms 3232 KB Output is correct
26 Correct 58 ms 3740 KB Output is correct