oj.uz

답안 #595072

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
595072 2022-07-13T10:32:11 Z 1bin Sure Bet (CEOI17_sure) C++17
0 / 100
 1 ms 212 KB 
#include <bits/stdc++.h>

using namespace std;

#define all(v) v.begin(), v.end()
typedef long long ll;
const int NMAX = 1e5 + 5;
int n, ix;
double a[NMAX], b[NMAX], ans, x, y;

int main(void){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    
    cout << fixed; cout.precision(4);
    cin >> n;
    for(int i = 0; i < n; i++) cin >> a[i], a[i] -= 1;
    for(int i = 0; i < n; i++) cin >> b[i], b[i] -= 1;
    sort(a, a + n); reverse(a, a + n);
    sort(b, b + n); reverse(b, b + n);
    
    ix = -1;
    for(int i = 0; i < n; i++){
        x += a[i]; y -= 1;
        while(ix + 1 < n && min(x, y) <= min(x - 1, y + b[ix + 1])){
            y += b[++ix]; x -= 1;
        }
        ans = max(ans, min(x, y));
    }
    cout << ans;
    return 0;
}

Subtask #1
0 / 20.0

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

Subtask #2
0 / 40.0

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

Subtask #3
0 / 40.0

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