Submission #938308

#	Time	Username	Problem	Language	Result	Execution time	Memory
938308		vjudge1	Sure Bet (CEOI17_sure)	C++17	60 / 100	2079 ms	2952 KiB

sure

#include "bits/stdc++.h"
 
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 
 
using namespace __gnu_pbds; 
 
using namespace std;
 
#define int long long
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
#define ordered_mset tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update> 
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> 

const double INF = 1e4;

int binpow (int a, int n) {
	if (n == 0)
		return 1;
	if (n % 2 == 1)
		return binpow (a, n-1) * a;
	else {
		int b = binpow (a, n/2);
		return b * b;
	}
}

void solve(){	
	
	int n;
	cin >> n;
	double a[n],b[n];
	for(int i = 0;i < n;i++){
		cin >> a[i] >> b[i];
	}
	sort(a,a + n);
	sort(b,b + n);
	
	reverse(a,a + n);
	reverse(b,b + n);
	double ans = 0;
	double sum1 = 0;
	for(int i = 1;i <= n;i++){
		sum1 += a[i - 1];
		double sum2 = 0;
		for(int j = 1;j <= n;j++){
			sum2 += b[j - 1];
			int cnt = i + j;
			
			ans = max(ans,min(sum1 - cnt,sum2 - cnt));
			if(sum1 - cnt < sum2 - cnt){
				break;
			}
		}
	}
	cout << fixed << setprecision(4);
	cout << ans << "\n";
	
}
 
signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	
	int t = 1;
//	cin >> t;
	while(t--){
		solve();
	}
}

• Subtask 1: 20 / 20
• Subtask 2: 40 / 40
• Subtask 3: 0 / 40