Submission #447343

#TimeUsernameProblemLanguageResultExecution timeMemory
447343fuad27Sure Bet (CEOI17_sure)C++14
60 / 100
2084 ms4668 KiB
#include<bits/stdc++.h> using namespace std; int main () { int n;cin>>n; long double ans = 0.0; long double a[n], b[n]; for(int i = 0;i<n;i++){ cin>>a[i]>>b[i]; } sort(a, a+n, greater<long double> () );sort(b, b+n, greater<long double> ()); for(int i = 1;i<n;i++)a[i]+=a[i-1],b[i]+=b[i-1]; for(int i=0;i<n;i++) { for(int j = 0;j<n;j++){ ans=max(ans, min(a[i], b[j]) - i - j - 2); } }cout<<fixed<<setprecision(4)<<ans<<endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...