Submission #577120

#TimeUsernameProblemLanguageResultExecution timeMemory
577120andrei_boacaSure Bet (CEOI17_sure)C++14
60 / 100
2066 ms3164 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; double a[100005],b[100005],ans; int n; int main() { cin>>n; for(int i=1;i<=n;i++) cin>>a[i]>>b[i]; sort(a+1,a+n+1); reverse(a+1,a+n+1); sort(b+1,b+n+1); reverse(b+1,b+n+1); for(int i=1;i<=n;i++) a[i]+=a[i-1]; for(int i=1;i<=n;i++) b[i]+=b[i-1]; for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) { double x=min(a[i],b[j])-i-j; ans=max(ans,x); } cout<<fixed<<setprecision(4)<<ans; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...