oj.uz

답안 #1097514

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1097514 2024-10-07T14:14:52 Z TrinhKhanhDung Sure Bet (CEOI17_sure) C++14
0 / 100
 0 ms 344 KB 
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define sz(x) (int)x.size()
#define ALL(v) v.begin(),v.end()
#define MASK(k) (1LL << (k))
#define BIT(x, i) (((x) >> (i)) & 1)
#define oo (ll)1e18
#define INF (ll)1e9
#define MOD (ll)(1e9 + 7)

using namespace std;

template<class T1, class T2>
    bool maximize(T1 &a, T2 b){if(a < b){a = b; return true;} return false;}

template<class T1, class T2>
    bool minimize(T1 &a, T2 b){if(a > b){a = b; return true;} return false;}

template<class T1, class T2>
    void add(T1 &a, T2 b){a += b; if(a >= MOD) a -= MOD;}

template<class T1, class T2>
    void sub(T1 &a, T2 b){a -= b; if(a < 0) a += MOD;}

template<class T>
    void cps(T &v){sort(ALL(v)); v.resize(unique(ALL(v)) - v.begin());}

const int MAX = 1e5 + 10;

int N;
double A[MAX], B[MAX];

void solve(){
    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>());
    for(int i = 1; i <= N; i++){
        cout << A[i] << ' ' << B[i] << '\n';
        A[i] += A[i - 1];
        B[i] += B[i - 1];
    }

    double ans = -1e9;

    for(int i = 0; i <= N; i++){
        int l = 0, r = N;
        while(l < r){
//            cerr << l << ' ' << r << '\n';
            int m = (l + r + 1) >> 1;
            if(A[i] - (m + i) >= B[m] - (m + i)) l = m;
            else r = m - 1;
        }

//        cout << i << ' ' << l << '\n';

        maximize(ans, min(A[i] - (i + l), B[l] - (i + l)));
        if(l < N){
            l++;
            maximize(ans, min(A[i] - (i + l), B[l] - (i + l)));
        }
//        cout << ans << '\n';
    }

    cout << fixed << setprecision(4) << ans << '\n';
}

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

    int t = 1;
//    cin >> t;
    while(t--){
        solve();
    }

    return 0;
}

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -