Submission #368363

# Submission time Handle Problem Language Result Execution time Memory
368363 2021-02-20T01:17:12 Z TosakaUCW Pareto (COCI17_pareto) C++17
80 / 80
46 ms 4204 KB
#include <stdio.h>
#include <algorithm>

int read(int x = 0, int f = 0, char ch = getchar())
{
    while ('0' > ch or ch > '9')
        f = ch == '-', ch = getchar();
    while ('0' <= ch and ch <= '9')
        x = x * 10 + (ch ^ 48), ch = getchar();
    return f ? -x : x;
}

const int N = 3e5 + 5;

int n;
double tot, x, y, sum, a[N];

bool cmp(double a, double b) { return a > b; }

int main()
{
    // freopen("pareto.in", "r", stdin), freopen("pareto.out", "w", stdout);
    n = read();
    for (int i = 1; i <= n; i++)
        sum += a[i] = read();
    std::sort(a + 1, a + 1 + n, cmp);
    for (int i = 1; i <= n; i++)
    {
        tot += a[i];
        double nowx = i * 100.0 / n;
        double nowy = tot * 100.0 / sum;
        if (nowy - nowx > y - x)
            x = nowx, y = nowy;
    }
    return printf("%.2f\n%.2f", x, y), 0;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 2 ms 492 KB Output is correct
6 Correct 15 ms 1772 KB Output is correct
7 Correct 34 ms 3172 KB Output is correct
8 Correct 46 ms 4204 KB Output is correct