Submission #883277

# Submission time Handle Problem Language Result Execution time Memory
883277 2023-12-05T03:20:33 Z votranngocvy Sure Bet (CEOI17_sure) C++14
0 / 100
1 ms 2516 KB
#include <bits/stdc++.h>
using namespace std;

const int N = 1e5 + 5;
double a[N],b[N],sumA[N],sumB[N];

signed main() {
    ios_base::sync_with_stdio(0);
    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 + n + 1,greater<double>());
    sort(b + 1,b + n + 1,greater<double>());
    sumA[0] = 0,sumB[0] = 0;
    for (int i = 1; i <= n; i++) {
        sumA[i] = sumA[i - 1] + a[i];
        sumB[i] = sumB[i - 1] + b[i];
    }
    int j = 1;
    double ans = 0;
    for (int i = 1; i <= n; i++) {
        while (j <= n && sumA[i] + sumB[j] - i - j <= sumA[i] + sumB[j - 1] - i - j - 1) j++;
        ans = max(ans,min(sumA[i],sumB[j]) - i - j);
    }
    cout << fixed << setprecision(4) << ans << "\n";
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Incorrect 1 ms 2516 KB Output isn't correct
4 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Incorrect 1 ms 2516 KB Output isn't correct
4 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Incorrect 1 ms 2516 KB Output isn't correct
4 Halted 0 ms 0 KB -