# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
853614 | mbfibat | Sure Bet (CEOI17_sure) | C++17 | 1139 ms | 8500 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 11;
double a[N], b[N];
int main(int argc, char** argv) {
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int n; cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i] >> b[i];
sort(a + 1, a + 1 + n, greater<double>());
sort(b + 1, b + 1 + n, greater<double>());
double ans = 0.0;
int pos_a = 1, pos_b = 1, cnt = 0;
double sum_a = 0, sum_b = 0;
while (1) {
++cnt;
if (sum_a < sum_b) {
if (pos_a > n) break;
sum_a += a[pos_a++];
} else if (sum_b < sum_a) {
if (pos_b > n) break;
sum_b += b[pos_b++];
} else {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |