| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 938326 |
2024-03-05T04:41:14 Z |
vjudge1 |
Sure Bet (CEOI17_sure) |
C++17 |
|
58 ms |
2016 KB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) x.begin(), x.end()
#define size(x) (int)x.size()
template<class S, class T>
bool chmin(S &a, const T &b) {
return a > b ? (a = b) == b : false;
}
template<class S, class T>
bool chmax(S &a, const T &b) {
return a < b ? (a = b) == b : false;
}
signed main() {
cin.tie(nullptr)->sync_with_stdio(false);
int n; cin >> n;
vector<double> a(n), b(n);
for (int i = 0; i < n; ++i) {
cin >> a[i] >> b[i];
}
sort(all(a)), sort(all(b));
double res = 0;
double A = a.back() - 2, B = b.back() - 2;
a.pop_back(), b.pop_back();
chmax(res, min(A, B));
while (!a.empty() && !b.empty()) {
if (A < B) {
A += a.back() - 1;
B += -1;
a.pop_back();
} else {
B += b.back() - 1;
A += -1;
b.pop_back();
}
chmax(res, min(A, B));
}
while (!a.empty()) {
A += a.back() - 1;
B += -1;
a.pop_back();
chmax(res, min(A, B));
}
while (!b.empty()) {
B += b.back() - 1;
A += -1;
b.pop_back();
chmax(res, min(A, B));
}
cout << fixed << setprecision(4) << res;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
344 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
344 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
344 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
344 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
1 ms |
348 KB |
Output is correct |
| 10 |
Correct |
1 ms |
348 KB |
Output is correct |
| 11 |
Correct |
0 ms |
348 KB |
Output is correct |
| 12 |
Correct |
1 ms |
348 KB |
Output is correct |
| 13 |
Correct |
1 ms |
348 KB |
Output is correct |
| 14 |
Correct |
1 ms |
344 KB |
Output is correct |
| 15 |
Correct |
1 ms |
348 KB |
Output is correct |
| 16 |
Correct |
1 ms |
348 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
344 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
344 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
1 ms |
348 KB |
Output is correct |
| 10 |
Correct |
1 ms |
348 KB |
Output is correct |
| 11 |
Correct |
0 ms |
348 KB |
Output is correct |
| 12 |
Correct |
1 ms |
348 KB |
Output is correct |
| 13 |
Correct |
1 ms |
348 KB |
Output is correct |
| 14 |
Correct |
1 ms |
344 KB |
Output is correct |
| 15 |
Correct |
1 ms |
348 KB |
Output is correct |
| 16 |
Correct |
1 ms |
348 KB |
Output is correct |
| 17 |
Correct |
56 ms |
2012 KB |
Output is correct |
| 18 |
Correct |
55 ms |
2016 KB |
Output is correct |
| 19 |
Correct |
57 ms |
2012 KB |
Output is correct |
| 20 |
Correct |
55 ms |
1884 KB |
Output is correct |
| 21 |
Correct |
58 ms |
1880 KB |
Output is correct |
| 22 |
Correct |
55 ms |
1880 KB |
Output is correct |
| 23 |
Correct |
56 ms |
1884 KB |
Output is correct |
| 24 |
Correct |
55 ms |
1884 KB |
Output is correct |
| 25 |
Correct |
57 ms |
1880 KB |
Output is correct |
| 26 |
Correct |
57 ms |
1880 KB |
Output is correct |
