# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
599721 | f1nder | Pareto (COCI17_pareto) | C++17 | 43 ms | 4948 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;
void solve();
int main()
{
ios_base::sync_with_stdio(false);cin.tie(NULL);
int t=1;
while(t--)
{
solve();
cout<<"\n";
}
//cerr<<"time taken : "<<(float)clock()/CLOCKS_PER_SEC<<" secs"<<endl;
return 0;
}
void solve()
{
int n;cin>>n;
std::vector<long long int> v(n),p(n) ;long long int sum=0;
for (int i = 0; i < n; i++) {
/* code */
cin>>v[i];sum+=v[i];
}
sort(v.rbegin(),v.rend());
double hi; double ai;
p[0]=v[0];
double h=((v[0]*100.0)/sum);
double a=100.0/n;
for (int i = 1; i <= n; i++){
p[i]+=p[i-1]+v[i];
hi=(p[i]*100.0)/sum;
ai=((i+1)*100.0)/n;
if((hi-ai)>(h-a)) {h=hi;a=ai;}
}
cout<<fixed<<setprecision(10)<<a<<"\n"<<h;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |