# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
246346 | NONAME | Pareto (COCI17_pareto) | C++14 | 141 ms | 6648 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define dbg(x) cerr << #x << " = " << x << "\n"
#define fast_io ios_base::sync_with_stdio(0); cin.tie(0); cout.tie()
using namespace std;
using ll = long long;
using ld = long double;
int main() {
fast_io;
int n;
ld total = 0;
cin >> n;
vector <ld> a(n);
for (ld &i : a)
cin >> i, total += i;
sort(a.rbegin(), a.rend());
ld aa = 0, ab = 0;
ld cur = 0;
for (int i = 0; i < n; ++i) {
ld cura, curb;
cur += a[i];
cura = ld(i + 1) * 100.0 / ld(n);
curb = cur * 100 / total;
if (curb - cura > ab - aa)
aa = cura, ab = curb;
}
cout.precision(2); cout << fixed;
cout << aa << "\n" << ab << "\n";
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |