Submission #52679

#TimeUsernameProblemLanguageResultExecution timeMemory
52679snat123Sure Bet (CEOI17_sure)C++14
60 / 100
143 ms2340 KiB
#include<bits/stdc++.h>
 
using namespace std;
 
double a[100001], b[100001];

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
    int n;
    cin >> n;
    for(int i=0; i<n; i++) cin >> a[i] >> b[i];
    sort(a, a+n);
	sort(b, b+n);
	int i=n-1, j=n-1;
	double x=0.0, y=0.0, res=0.0;
	while(i>=0 || j>=0){
		if(j>=0 && x>y) y+=b[j--];
		else x+=a[i--];
		res=max(res, min(x, y)-(n-i)-(n-j)+2);
	}
	cout << fixed << setprecision(4) << res;
    return 0;
} 
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...