oj.uz

Submission #726848

# Submission time Handle Problem Language Result Execution time Memory
726848 2023-04-19T12:36:41 Z penguin133 Sure Bet (CEOI17_sure) C++17
60 / 100
 2000 ms 4716 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

long double A[100005], B[100005];

void solve(){
	int n; cin >> n;
	for(int i=1;i<=n;i++)cin >> A[i] >> B[i];
	sort(A+1, A+n+1);
	sort(B+1, B+n+1);
	long double ans = 0, cur = 0;
	for(int i=n;i>=1;i--){
		long double cur2 = 0;
		cur += A[i];
		for(int j=n;j>=1;j--){
			cur2 += (long double)(B[j]);
			ans = max(ans, min(cur, cur2) - (n - i + 1 + n - j + 1));
		}
	}
	cout << fixed << setprecision(4) << ans;
}

main(){
	ios::sync_with_stdio(0);cin.tie(0);
	int tc = 1;
	//cin >> tc;
	for(int tc1=1;tc1<=tc;tc1++){
		// cout << "Case #" << tc1 << ": ";
		solve();
	}
}

Compilation message

sure.cpp:33:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   33 | main(){
      | ^~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct

Subtask #2
40.0 / 40.0

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

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 5 ms 348 KB Output is correct
13 Correct 5 ms 340 KB Output is correct
14 Correct 6 ms 340 KB Output is correct
15 Correct 7 ms 340 KB Output is correct
16 Correct 7 ms 396 KB Output is correct
17 Execution timed out 2066 ms 4716 KB Time limit exceeded
18 Halted 0 ms 0 KB -