# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
860920 | GordonRemzi007 | Sure Bet (CEOI17_sure) | C++17 | 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 <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
using namespace std;
bool srt(float a, float b) {
return a > b;
}
int main() {
int n, f = 0, s = 0;
float fsum = 0, ssum = 0, res = 0;
cin >> n;
vector<float> a(n), b(n);
for(int i = 0; i < n; i++) cin >> a[i] >> b[i];
sort(a.begin(), a.end(), srt);
sort(b.begin(), b.end(), srt);
//Sa <= Sb
while(f < n && s < n) {
while(fsum <= ssum && f < n) {
fsum+=a[f];
f++;
if(fsum <= ssum) {
res = max(res, fsum-f-s);
}
}
while(fsum > ssum && s < n) {
ssum+=b[s];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |