oj.uz

답안 #849512

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
849512 2023-09-14T21:14:29 Z Benmath Sure Bet (CEOI17_sure) C++14
60 / 100
 3 ms 604 KB 
/******************************************************************************

                              Online C++ Compiler.
               Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.

*******************************************************************************/

#include <bits/stdc++.h>

using namespace std;
int n;
double prvi[1010];
double drugi[1010];
int main(){
    cin >> n;
    for(int i = 0; i < n; i++){
        cin >> prvi[i];
        cin >> drugi[i];
    }
    sort(prvi, prvi+n);
    sort(drugi,drugi+n);
    double suma_prva = 0;
    double suma_druga = 0;
    double ans = 0;
    for(int i = n-1; i>=0; i--){
        suma_prva = suma_prva + prvi[i];
        suma_druga = 0;
        for(int j = n-1; j>=0; j--){
            double broj_prvih = n-i;
            double broj_drugih = n-j;
            double ukupan = broj_prvih + broj_drugih;
            suma_druga = suma_druga + drugi[j];
            double rezultat = min(suma_prva - ukupan, suma_druga - ukupan);
            ans = max(ans, rezultat);
        }
    }
 printf("%.4lf",(double)ans);

}

Subtask #1
20.0 / 20.0

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

Subtask #2
40.0 / 40.0

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

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 3 ms 604 KB Output is correct
13 Correct 3 ms 348 KB Output is correct
14 Correct 3 ms 348 KB Output is correct
15 Correct 3 ms 348 KB Output is correct
16 Correct 3 ms 348 KB Output is correct
17 Runtime error 2 ms 600 KB Execution killed with signal 11
18 Halted 0 ms 0 KB -