Submission #1174060

#TimeUsernameProblemLanguageResultExecution timeMemory
1174060selunellePareto (COCI17_pareto)C++20
80 / 80
79 ms21324 KiB
#include<bits/stdc++.h>
using namespace std;
#define ll long long 
int main(){
	double n,i,j,k=0,m=0;
	cin>>n;
	vector<ll> v(n);
	vector<double> sum(n,0);
	for(i=0;i<n;i++){
		cin>>v[i];
		k+=v[i];
	}
	vector<vector<double> > vec(n,vector<double>(2));
	sort(v.rbegin(),v.rend());
		for(i=0;i<n-1;i++){
		if(i<n-1){
			sum[i+1]=sum[i]+v[i];
		}
		vec[i][0]=(i+1)/n*100;
		vec[i][1]=sum[i+1]/k*100;
	}
	for( auto w:vec){
		m=max(m,w[1]-w[0]);
	}
	for(auto w:vec){
		if(w[1]-w[0]==m){
			cout<<w[0]<<"\n"<<w[1];
			return 0;
		}
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...