Submission #903998

#TimeUsernameProblemLanguageResultExecution timeMemory
903998Dec0DeddSure Bet (CEOI17_sure)C++14
0 / 100
1 ms404 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int, int> pii; const int N = 100; const int K = 1e4; ll a[N], b[N], n; void solve() { cin>>n; for (int i=1; i<=n; ++i) cin>>a[i]>>b[i], a[i]*=K, b[i]*=K; sort(a+1, a+n+1, greater<ll>()), sort(b+1, b+n+1, greater<ll>()); ll ans=0, sa=0; for (int i=0; i<=n; ++i) { ll sb=0; sa+=a[i]; for (int j=0; j<=n; ++j) { sb+=b[j]; ans=max(ans, min(sa, sb)-i*K-j*K); } } //cout<<ans<<"\n"; printf("%.4lf", (double)((ans*1.0)/(K*1.0))); } 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...