Submission #52632

#TimeUsernameProblemLanguageResultExecution timeMemory
52632snat123Sure Bet (CEOI17_sure)C++14
0 / 100
2 ms484 KiB
#include<bits/stdc++.h> using namespace std; int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; long 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; long double x=0, y=0, res=0.0; while(i>=0 && j>=0){ if(x>=y){ y+=b[j--]; x-=1; y-=1; res=max(res, min(x, y)); } else{ x+=a[i--]; y-=1; x-=1; res=max(res, min(x, y)); } } 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...