# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
370146 | Atill83 | Pareto (COCI17_pareto) | C++14 | 57 ms | 3052 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 ff first
#define ss second
#define endl '\n'
using namespace std;
const long long INF = (long long) 1e18;
const int mod = (int) 1e9+7;
const int MAXN = (int) 3e5+5;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll n;
int a[MAXN];
typedef long double ld;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);cout.tie(nullptr);
#ifdef Local
freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/int.txt","r",stdin);
freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/out.txt","w",stdout);
#endif
cin>>n;
ll toplam = 0;
for(int i = 0; i < n; i++){
cin>>a[i];
toplam += a[i];
}
sort(a, a + n, greater<int>());
ld mxA = 100, mxB = 100;
ll sim = 0;
for(int i = 0; i < n; i++){
sim += a[i];
ld a = 100 * (ld) (i + 1) / n, b = 100 * (ld) sim / toplam;
if(b - a > mxB - mxA){
mxB = b;
mxA = a;
}
}
cout<<fixed<<setprecision(10)<<mxA<<" "<<mxB<<endl;
#ifdef Local
cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
#endif
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |