oj.uz

Submission #865278

# Submission time Handle Problem Language Result Execution time Memory
865278 2023-10-24T06:59:10 Z vjudge1 Sure Bet (CEOI17_sure) C++17
0 / 100
 1 ms 2396 KB 
#include <bits/stdc++.h>
 
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
#define optimus_prime ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define fxd(x) fixed << setprecision(x)
#define all(a) (a.begin() , a.end())
#define popcount(x) __builtin_popcount(x)
#define lwb lower_bound
#define upb upper_bound
#define dl long double
#define ll long long
#define pb push_back
#define sz() size()
#define F first
#define S second
 
using namespace std;
 
const ll N = 1e5+9;
const ll inf=1e9+9;
const ll mod=1e9+7;
const ll P = 37;

ll n;
dl a[N] , b[N] , ans;

void solve(){
	cin >> n;
	for (int i = 1 ; i <= n ; i++)cin >> a[i] >> b[i];
	sort (a+1 , a+1+n);
	sort (b+1 , b+1+n);
	reverse (a+1 , a+1+n);
	reverse (b+1 , b+1+n);
	for (int i = 1 ; i <= 2*n ; i++){
		dl sum1=0 , sum2=0;
		ll ind1=1 , ind2=1 , cnt=i;
		while (sum1<i&&cnt){
			sum1+=a[ind1];
			ind1++;
			cnt--;
		}
		while (sum2<i&&cnt){
			sum2+=(b[ind2]);
			ind2++;
			cnt--;
		}
		while (cnt){
			cnt--;
			if (ind1>n){
				sum2+=b[ind2];
				ind2++;
				continue;
			}
			if (ind2>n){
				sum1+=a[ind1];
				ind1++;
				continue;
			}
			if (a[ind1]>a[ind2]){
				sum1+=a[ind1];
				ind1++;
			}
			else {
				sum2+=b[ind2];
				ind2++;
			}
		}
		sum1-=i;
		sum2-=i;
		// cout << i << " " << min(sum1 , sum2) << "\n";
		ans=max(ans , min(sum1 , sum2));
	}
	cout << fxd(4) << ans;
}
	
signed main() {
	optimus_prime;
	solve();
return 0;
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Incorrect 1 ms 2392 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Incorrect 1 ms 2392 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Incorrect 1 ms 2392 KB Output isn't correct
5 Halted 0 ms 0 KB -