oj.uz

답안 #504127

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
504127 2022-01-09T21:56:25 Z Hacv16 Sure Bet (CEOI17_sure) C++17
0 / 100
 0 ms 332 KB 
#include<bits/stdc++.h>
using namespace std;

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

const int MAX = 2e6 + 15;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;

#define pb push_back
#define sz(x) (int) x.size()
#define fr first
#define sc second
#define mp make_pair
#define all(x) x.begin(), x.end()

int n;
long double a[MAX], b[MAX];

void setIO(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); 
}

int main(){
    setIO();

    cin >> n;

    for(int i = 0; i < n; i++){
        cin >> a[i] >> b[i];
    }

    sort(a, a + n, greater<long double>());
    sort(b, b + n, greater<long double>());

    int pa = 1, pb = 1;
    long double sa = a[0], sb = b[0], ans = 0;

    while(pa != n && pb != n){
        if(sa < sb){
            sa += a[pa];
            pa++;
        }else{
            sb += b[pb];
            pb++;
        }

        ans = max(ans, min(sa - (pa + pb), sb - (pa + pb)));
    }
 
    cout << setprecision(4) << fixed << ans << endl;

    return 0;
}

 
/* stuff you should look for
    * int overflow, array bounds
    * special cases (n=1?)
    * do smth instead of nothing and stay organized
    * brute force to find pattern?
    * sort?
    * graph?
    * WRITE STUFF DOWN
    * DON'T GET STUCK ON ONE APPROACH
*/

Subtask #1
0 / 20.0

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

Subtask #2
0 / 40.0

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

Subtask #3
0 / 40.0

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