# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
873619 | vjudge1 | Pareto (COCI17_pareto) | C++17 | 42 ms | 7700 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>
#ifdef LOCAL
#include "Essentials/algo/debug.h"
#else
#define debug(...) 69
#endif
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef long double ldb;
const int N = 3e5 + 23;
const ll inf = 1e18;
#define F first
#define S second
#define pb push_back
#define kill(x) cout<<x<<endl, exit(0);
#define all(x) x.begin(),x.end()
#define sz(x) (int)x.size()
#define lc (v << 1)
#define rc ((v<<1) |1)
#define int ll
int n;
vector<int> vals;
pair< ldb, pair<ldb,ldb>> ans= {0.0 , {100.0 , 100.0}};
int32_t main() {
cin.tie(nullptr)->sync_with_stdio(false);
cin>>n;
int sum = 0;
for(int i = 0 ; i<n ; i++) {
int x; cin>>x;
vals.pb(x);
sum += x;
}
sort(all(vals),greater<>());
int sum1= 0;
for(int i = 0 ; i< n ; i++) {
sum1 += vals[i];
ldb A = (i+1)*1.0 / n;
ldb B = sum1*1.0 / sum;
ans = max(ans, {B-A, {A,B}});
}
cout<<fixed << ans.S.F*100 << '\n'<< ans.S.S*100 << '\n';
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |