Submission #595074

#TimeUsernameProblemLanguageResultExecution timeMemory
5950741binSure Bet (CEOI17_sure)C++14
100 / 100
91 ms3788 KiB
#include <bits/stdc++.h> using namespace std; #define all(v) v.begin(), v.end() typedef long long ll; const int NMAX = 1e5 + 5; int n, ix; double a[NMAX], b[NMAX], ans, x, y; int main(void){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout << fixed; cout.precision(4); cin >> n; for(int i = 0; i < n; i++) cin >> a[i] >> b[i], a[i] -= 1, b[i] -= 1; sort(a, a + n); reverse(a, a + n); sort(b, b + n); reverse(b, b + n); ix = -1; for(int i = 0; i < n; i++){ x += a[i]; y -= 1; while(ix + 1 < n && min(x, y) <= min(x - 1, y + b[ix + 1])){ y += b[++ix]; x -= 1; } ans = max(ans, min(x, y)); } cout << ans; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...