# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1027174 | toan2602 | Sure Bet (CEOI17_sure) | C++14 | 0 ms | 344 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;
int n;
double a[100005], b[100005];
void solve() {
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i] >> b[i];
sort(a+1,a+1+n, greater<>());
sort(b+1,b+1+n, greater<>());
double ra, rb, res = 0;
int p1, p2;
ra = rb = 0;
p1 = p2 = 1;
for (int i = 1; i <= 2*n; i++) {
if((ra < rb && p1 <= n) || p2 == n+1) {
ra += a[p1];
p1++;
}
else {
rb += b[p2];
p2++;
}
res = max(res, min(ra-i,rb-i));
}
cout << res;
}
signed main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
if(fopen("input.inp","r")){
freopen("input.inp", "r", stdin);
freopen("output.out", "w", stdout);
}
int t = 1;
// cin >> t;
while(t--) {
solve();
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |