oj.uz

Submission #597105

# Submission time Handle Problem Language Result Execution time Memory
597105 2022-07-15T13:53:07 Z kabika Pareto (COCI17_pareto) C++14
80 / 80
 47 ms 4196 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin >> n;
    vector<ll> m(n,0);
    ll tot = 0;
    for(int i = 0; i < n; ++i)
    {
        cin >> m[i];
        tot += m[i];
    }
    sort(m.begin(),m.end(),greater<ll>());
    
    ll temp = 0;
    ld diff = 0;
    ld a = 0, b = 0;
    for(int i = 0; i < n; ++i)
    {
        temp += m[i];
        ld ta = (i+1)*100.0/n;
        ld tb = temp*100.0/tot;
        if(tb-ta >= diff)
        {
            b = tb;
            a = ta;
            diff = b-a;
        }
    }
    
    cout << a << '\n' << b << '\n';
    return 0;
}

Subtask #1
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 ms 464 KB Output is correct
6 Correct 14 ms 1612 KB Output is correct
7 Correct 30 ms 3028 KB Output is correct
8 Correct 47 ms 4196 KB Output is correct