oj.uz

Submission #491011

# Submission time Handle Problem Language Result Execution time Memory
491011 2021-11-30T03:42:06 Z duchung Sure Bet (CEOI17_sure) C++17
0 / 100
 0 ms 204 KB 
#include<bits/stdc++.h>
using namespace std;

const int N = 1e5 + 5;

int n;
double a[N] , b[N];

int main()
{
    // freopen(".inp","r",stdin);
    // freopen(".out","w",stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    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> {});

    double sumA = 0 , sumB = 0 , ans = -1e18;
    int ptA = 0 , ptB = 0;
    for (int i = 1 ; i <= 2 * n ; ++i)
    {
        if (sumA <= sumB && ptA + 1 <= n)
        {
            sumA += a[++ptA];
        }
        else
        {
            sumB += b[++ptB];
        }
        ans = max(ans , min(sumA , sumB) - (double) i);
    }
    cout << fixed << setprecision(4) << ans;
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -