oj.uz

Submission #1089576

# Submission time Handle Problem Language Result Execution time Memory
1089576 2024-09-16T17:17:37 Z toast12 Pareto (COCI17_pareto) C++14
80 / 80
 64 ms 3008 KB 
#include <bits/stdc++.h>
using namespace std;

int main() {
    int n;
    cin >> n;
    vector<int> v(n);
    double tot = 0;
    for (int i = 0; i < n; i++) {
        cin >> v[i];
        tot += v[i];
    }
    sort(v.begin(), v.end());
    reverse(v.begin(), v.end());
    double cur = 0;
    double a = 0, b = 0;
    double ans = 0;
    for (int i = 0; i < n; i++) {
        cur += v[i];
        double a2 = double(i+1)/n;
        double b2 = cur/tot;
        if (b2-a2 > ans) {
            ans = b2-a2;
            a = a2, b = b2;
        }
    }
    cout << fixed << setprecision(5) << a*100 << '\n' << b*100 << '\n';
    return 0;
}

Subtask #1
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Correct 33 ms 1312 KB Output is correct
7 Correct 46 ms 2388 KB Output is correct
8 Correct 64 ms 3008 KB Output is correct