| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 860933 |
2023-10-14T19:25:52 Z |
vjudge1 |
Sure Bet (CEOI17_sure) |
C++17 |
|
112 ms |
1992 KB |
#include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
using namespace std;
bool srt(double a, double b) {
return a > b;
}
int main() {
int n, f = 0, s = 0;
double fsum = 0, ssum = 0, res = 0;
cin >> n;
vector<double> 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];
s++;
}
if(fsum <= ssum) res = max(res, fsum-f-s);
}
//Sb <= Sa
f = 0, s = 0, fsum = 0, ssum = 0;
while(f < n && s < n) {
while(ssum <= fsum && s < n) {
ssum+=b[s];
s++;
if(ssum <= fsum) res = max(res, ssum-f-s);
}
while(ssum > fsum && f < n) {
fsum+=a[f];
f++;
}
if(ssum <= fsum) res = max(res, ssum-f-s);
}
cout << fixed << setprecision(4) << res << "\n";
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 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 |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 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 |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Correct |
1 ms |
344 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
1 ms |
348 KB |
Output is correct |
| 10 |
Correct |
0 ms |
344 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 |
348 KB |
Output is correct |
| 15 |
Correct |
2 ms |
348 KB |
Output is correct |
| 16 |
Correct |
2 ms |
348 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 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 |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Correct |
1 ms |
344 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
1 ms |
348 KB |
Output is correct |
| 10 |
Correct |
0 ms |
344 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 |
348 KB |
Output is correct |
| 15 |
Correct |
2 ms |
348 KB |
Output is correct |
| 16 |
Correct |
2 ms |
348 KB |
Output is correct |
| 17 |
Correct |
106 ms |
1992 KB |
Output is correct |
| 18 |
Correct |
97 ms |
1880 KB |
Output is correct |
| 19 |
Correct |
98 ms |
1880 KB |
Output is correct |
| 20 |
Correct |
98 ms |
1880 KB |
Output is correct |
| 21 |
Correct |
109 ms |
1988 KB |
Output is correct |
| 22 |
Correct |
100 ms |
1884 KB |
Output is correct |
| 23 |
Correct |
112 ms |
1884 KB |
Output is correct |
| 24 |
Correct |
98 ms |
1880 KB |
Output is correct |
| 25 |
Correct |
98 ms |
1984 KB |
Output is correct |
| 26 |
Correct |
110 ms |
1992 KB |
Output is correct |
