Submission #1026994

# Submission time Handle Problem Language Result Execution time Memory
1026994 2024-07-18T17:11:54 Z vjudge1 Sure Bet (CEOI17_sure) C++14
100 / 100
74 ms 3564 KB
#pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define name "aaaaaa"
using ll = long long;
using pii = pair<int, int>;
using ld = long double;


void file(){
	ios_base::sync_with_stdio(0); cin.tie(0);
    if(fopen(name".inp", "r")) {
        freopen(name".inp", "r", stdin);
        freopen(name".out", "w", stdout);
    }
}

const int maxn = 1e5 + 5;

ld a[maxn], b[maxn];

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);
	ld suma = 0, sumb = 0, ans = 0;
	int p1 = n, p2 = n;
	while(1){
		if(p1 == -1 || p2 == -1) break;
		if(suma < sumb){
			suma += a[p1];
			p1--;
		}else{
			sumb += b[p2];
			p2--;
		}
		ans = max(ans, min(suma, sumb) - (n - p1) - (n - p2));
	}
	cout << fixed << setprecision(4) << ans;
}

int main(){
    file(); 
    solve();
}

Compilation message

sure.cpp: In function 'void file()':
sure.cpp:13:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |         freopen(name".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
sure.cpp:14:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |         freopen(name".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2540 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2528 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2540 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2528 KB Output is correct
17 Correct 64 ms 3412 KB Output is correct
18 Correct 59 ms 3412 KB Output is correct
19 Correct 59 ms 3408 KB Output is correct
20 Correct 59 ms 3412 KB Output is correct
21 Correct 61 ms 3416 KB Output is correct
22 Correct 59 ms 3476 KB Output is correct
23 Correct 74 ms 3564 KB Output is correct
24 Correct 58 ms 3416 KB Output is correct
25 Correct 60 ms 3340 KB Output is correct
26 Correct 60 ms 3388 KB Output is correct