oj.uz

답안 #246065

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
246065 2020-07-08T06:31:24 Z Vimmer Pareto (COCI17_pareto) C++14
80 / 80
 58 ms 2688 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define pf push_front
#define N 100100
#define M ll(1e9 + 7)
#define inf 1e9 + 1e9

using namespace std;
//using namespace __gnu_pbds;

typedef long double ld;
typedef long long ll;
typedef short int si;
typedef array <int, 3> a3;

//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;


int main()
{
    ////freopen("input.txt", "r", stdin); //freopen("output4.txt", "w", stdout);

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    ll n;

    cin >> n;

    ll sum = 0;

    ll ar[n];

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

        ar[i] *= 1000;

        sum += ar[i];
    }

    sort(ar, ar + n);

    ll smr = 0, kol = 0;

    ld a = 0, b = 0;

    for (int i = n - 1; i >= 0; i--)
    {
        smr += ar[i];

        kol++;

        ld na = (ld(kol) * ld(100.0)) / ld(n);

        ld nb = (ld(smr) * ld(100.0)) / ld(sum);

        ld razn = nb - na;

        if ((b - a) - razn < 0) {a = na; b = nb;}
    }

    cout << setprecision(6) << fixed;

    cout << a << endl << b << endl;
}

Subtask #1
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 6 ms 464 KB Output is correct
6 Correct 22 ms 1152 KB Output is correct
7 Correct 42 ms 1920 KB Output is correct
8 Correct 58 ms 2688 KB Output is correct