Submission #865757

#TimeUsernameProblemLanguageResultExecution timeMemory
865757vjudge1Sure Bet (CEOI17_sure)C++17
100 / 100
70 ms5192 KiB
//gm --- akezhon #include <bits/stdc++.h> //#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3") //#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") #define int long long #define pb push_back #define F first #define S second #define all(v) v.begin(),v.end() #define pii pair<int,int> #define tm (tl+tr)/2 #define TL v+v, tl, tm #define TR v+v+1, tm+1, tr #define DA l <= tl && tr <= r #define NET r < tl || tr < l #define double long double using namespace std; const int N=1e5+7; const int M=1e9+7; const int inf=1e9; double a[N], b[N]; int n; void AlemAmenov(){ cin >> n; for(int i=1; i <= n; i++){ cin >> a[i] >> b[i]; } sort(a+1, a+1+n); sort(b+1, b+1+n); reverse(a+1, a+1+n); reverse(b+1, b+1+n); double ans=0, aa=0, bb=0; int j=0; for(int i=1; i <= n; i++){ aa += a[i]; ans = max(ans, min(aa, bb)-i-j); while(bb < aa && j < n){ bb += b[++j]; ans = max(ans, min(aa, bb)-i-j); } ans = max(ans, min(aa, bb)-i-j); } cout << fixed << setprecision(4) << ans; } signed main(){ ios_base::sync_with_stdio(0); cin.tie(0); // freopen("promote.in", "r", stdin); // freopen("promote.out", "w", stdout); int RealName=1; // cin >> RealName; // int C=0; while(RealName--){ // cout << "Case " << ++C << ":\n"; AlemAmenov(); } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...