Submission #52661

#TimeUsernameProblemLanguageResultExecution timeMemory
52661snat123Sure Bet (CEOI17_sure)C++14
20 / 100
3 ms520 KiB
#include<bits/stdc++.h> using namespace std; int main(){ 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); int i=n-1, j=n-1; double x=0.0, y=0.0, res=0.0; while(i>=0 || j>=0){ if(x>=y || i<0) y+=b[j--]; else x+=a[i--]; //x-=1; //y-=1; res=max(res, min(x, y)-(n-1-i)-(n-1-j)); } printf("%.4lf", res); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...