제출 #967671

#제출 시각아이디문제언어결과실행 시간메모리
967671ByeWorldSure Bet (CEOI17_sure)C++14
0 / 100
0 ms348 KiB
#include <bits/stdc++.h> #define ll long long #define int long long #define pb push_back #define fi first #define se second #define lf (id<<1) #define rg ((id<<1)|1) #define md ((l+r)>>1) #define ld long double using namespace std; const int MAXN = 2e5+10; const int INF = 4e18+10; typedef pair<int,int> pii; typedef pair<pii,int> ipii; const int MX = 1e9+10; int n; vector <ld> vec, vec2; signed main(){ // ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); cin >> n; for(int i=1; i<=n; i++){ ld x, y; cin >> x >> y; vec.pb(x); vec2.pb(y); } sort(vec.rbegin(), vec.rend()); sort(vec2.rbegin(), vec2.rend()); ld ANS = 0, le = 0, ri = 0, l = 0, r = 0; while(l<vec.size() && r<vec2.size()){ if(le < ri){ le--; ri--; le += vec[l]; l++; } else { le--; ri--; ri += vec2[r]; r++; } // cout << le << ' '<< ri << " leri\n"; ANS = max(ANS, min(le, ri)); } cout << fixed << setprecision(6) << ANS<< '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...