# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
246085 | VEGAnn | Pareto (COCI17_pareto) | C++14 | 65 ms | 1656 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 PB push_back
#define sz(x) ((int)x.size())
#define all(x) x.begin(),x.end()
using namespace std;
typedef long long ll;
typedef long double ld;
const int oo = 2e9;
const int N = 300100;
const int md = 998244353;
const int PW = 233;
const int B = 700;
int a[N], n;
ld glob = 0, sum = 0, ans = -1, aB, aA;
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef _LOCAL
freopen("in.txt","r",stdin);
#endif // _LOCAl
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
glob += a[i];
}
sort(a, a + n);
reverse(a, a + n);
for (int i = 0; i < n; i++){
sum += a[i];
ld A = (ld(i) + 1.0) / ld(n);
ld B = sum / glob;
if (B - A > ans){
ans = B - A;
aB = B;
aA = A;
}
}
cout << fixed << setprecision(10) << aA * 100 << '\n' << aB * 100;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |