Submission #45458

#TimeUsernameProblemLanguageResultExecution timeMemory
45458nickyrioSure Bet (CEOI17_sure)C++17
100 / 100
127 ms2488 KiB
#include <bits/stdc++.h> #define FOR(i, a, b) for (int i = (a); i <= (b); ++i) #define FORD(i, a, b) for (int i = (a); i >= (b); --i) #define REP(i, a) for (int i = 0; i < (a); ++i) #define DEBUG(x) { cerr << #x << '=' << x << endl; } #define Arr(a, l, r) { cerr << #a << " = {"; FOR(_, l, r) cerr << ' ' << a[_]; cerr << "}\n"; } #define N 1001000 #define pp pair<int, int> #define endl '\n' #define IO ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL) #define taskname "" #define bit(S, i) (((S) >> (i)) & 1) using namespace std; double a[N], b[N]; int main() { #ifdef NERO freopen("test.inp","r",stdin); freopen("test.out","w",stdout); double stime = clock(); #else //freopen(taskname".inp","r",stdin); //freopen(taskname".out","w",stdout); #endif //NERO IO; int n; cin >> n; FOR(i, 1, n) cin >> a[i] >> b[i]; sort(a + 1, a + n + 1, greater<double>()); sort(b + 1, b + n + 1, greater<double>()); double ans = 0, sa = 0, sb = 0; int na = 0, nb = 0; FOR(buy, 1, n * 2) { if ((sa < sb && na < n) || sb == n) sa += a[++na]; else sb += b[++nb]; ans = max(ans, min(sa, sb) - 1.0 * buy); } cout << fixed << setprecision(4) << ans; #ifdef NERO double etime = clock(); cerr << "Execution time: " << (etime - stime) / CLOCKS_PER_SEC * 1000 << " ms.\n"; #endif // NERO }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...