oj.uz

Submission #903999

# Submission time Handle Problem Language Result Execution time Memory
903999 2024-01-11T16:39:17 Z Dec0Dedd Sure Bet (CEOI17_sure) C++14
0 / 100
 1 ms 360 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef long double ld;

const int N = 100;
const int K = 1e4;

ll a[N], b[N], n;

void solve() {
    cin>>n;
    for (int i=1; i<=n; ++i) {
        ld x; cin>>x;
        a[i]=x*K;
        cin>>x;
        b[i]=x*K;
    }
    sort(a+1, a+n+1, greater<ll>()), sort(b+1, b+n+1, greater<ll>());

    ll ans=0, sa=0;
    for (int i=0; i<=n; ++i) {
        ll sb=0; sa+=a[i];
        for (int j=0; j<=n; ++j) {
            sb+=b[j];
            ans=max(ans, min(sa, sb)-i*K-j*K);
        }
    } //cout<<ans<<"\n";

    printf("%.4lf", (double)((ans*1.0)/(K*1.0)));
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
    
    int t=1;
    while (t--) solve();
}

Subtask #1
0 / 20.0

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

Subtask #2
0 / 40.0

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

Subtask #3
0 / 40.0

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