# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1089576 | toast12 | Pareto (COCI17_pareto) | C++14 | 64 ms | 3008 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>
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;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |