oj.uz

답안 #246083

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
246083 2020-07-08T07:09:19 Z VEGAnn Pareto (COCI17_pareto) C++14
0 / 80
 70 ms 3064 KB 
#include <bits/stdc++.h>
#define PB push_back
#define sz(x) ((int)x.size())
#define all(x) x.begin(),x.end()
using namespace std;
typedef long long ll;
typedef long double ld;
const int oo = 2e9;
const int N = 300100;
const int md = 998244353;
const int PW = 233;
const int B = 700;
int a[N], n;
ld glob = 0, sum = 0, ans = -1, aB, aA;

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);

#ifdef _LOCAL
    freopen("in.txt","r",stdin);
#endif // _LOCAl

    cin >> n;

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

    sort(a, a + n);
    reverse(a, a + n);

    for (int i = 0; i < n; i++){
        sum += a[i];

        ld A = (ld(i) + 1.0) / ld(n);
        ld B = sum / glob;

        if (B - A > ans){
            ans = B - A;
            aB = B;
            aA = A;
        }
    }

    cout << fixed << setprecision(10) << aA << '\n' << aB;

    return 0;
}

Subtask #1
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 384 KB Output isn't correct
2 Incorrect 5 ms 384 KB Output isn't correct
3 Incorrect 5 ms 384 KB Output isn't correct
4 Incorrect 5 ms 384 KB Output isn't correct
5 Incorrect 7 ms 384 KB Output isn't correct
6 Incorrect 22 ms 1280 KB Output isn't correct
7 Incorrect 53 ms 2424 KB Output isn't correct
8 Incorrect 70 ms 3064 KB Output isn't correct