oj.uz

답안 #246085

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
246085 2020-07-08T07:10:15 Z VEGAnn Pareto (COCI17_pareto) C++14
80 / 80
 65 ms 1656 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 * 100 << '\n' << aB * 100;

    return 0;
}

Subtask #1
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 8 ms 384 KB Output is correct
6 Correct 23 ms 1024 KB Output is correct
7 Correct 44 ms 1272 KB Output is correct
8 Correct 65 ms 1656 KB Output is correct