Submission #904001

#TimeUsernameProblemLanguageResultExecution timeMemory
904001Dec0DeddSure Bet (CEOI17_sure)C++14
20 / 100
1 ms472 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int, int> pii; typedef long double ld; const int N = 100; ld a[N], b[N]; ll n; void solve() { cin>>n; for (int i=1; i<=n; ++i) { cin>>a[i]>>b[i]; } sort(a+1, a+n+1, greater<ld>()), sort(b+1, b+n+1, greater<ld>()); ld ans=0, sa=0; for (int i=0; i<=n; ++i) { ld sb=0; sa+=a[i]; for (int j=0; j<=n; ++j) { sb+=b[j]; ans=max(ans, min(sa, sb)-i-j); } } //cout<<ans<<"\n"; printf("%.4lf", (double)ans); } int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); int t=1; while (t--) solve(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...