oj.uz

답안 #1112631

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1112631 2024-11-14T12:59:04 Z sunboi Sure Bet (CEOI17_sure) C++17
60 / 100
 2000 ms 4680 KB 
#include <bits/stdc++.h>
 
using namespace std;
#define int long long
 

 
signed main(){
    double n; cin >> n;
    vector<double> a(n + 1), b(n + 1), pref(n + 1), prefb(n + 1);
    a[0] = 1e9;
    b[0] = 1e9;
    for (int i = 1; i <= n; i++){
        cin >> a[i];
        cin >> b[i];
    }
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());
    reverse(a.begin(), a.end());
    reverse(b.begin(), b.end());
    a[0] = 0;
    b[0] = 0;
    for (int i = 1; i <= n; i++){
        pref[i] = pref[i - 1] + a[i];
        prefb[i] = prefb[i - 1] + b[i];
    }
    
    double ans = 0;
    for (double monedas = 0; monedas <= 2 * n; monedas++){
        for (int i = 0; i <= min(monedas, n); i++){
            int j = monedas - i;
            if (0 <= j && j <= n){
                ans = max(ans, min(pref[i] - monedas, prefb[j] - monedas));
            }
        }
    }
    printf("%.4lf",(double)ans);
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 440 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 5 ms 336 KB Output is correct
13 Correct 5 ms 336 KB Output is correct
14 Correct 5 ms 484 KB Output is correct
15 Correct 6 ms 336 KB Output is correct
16 Correct 5 ms 504 KB Output is correct

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 440 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 5 ms 336 KB Output is correct
13 Correct 5 ms 336 KB Output is correct
14 Correct 5 ms 484 KB Output is correct
15 Correct 6 ms 336 KB Output is correct
16 Correct 5 ms 504 KB Output is correct
17 Execution timed out 2060 ms 4680 KB Time limit exceeded
18 Halted 0 ms 0 KB -