Submission #1174022

#TimeUsernameProblemLanguageResultExecution timeMemory
1174022nuutsnoyntonPareto (COCI17_pareto)C++20
80 / 80
61 ms2632 KiB
#include<bits/stdc++.h>

using namespace std;
using ll = long long;

int main() {
	ll n, m, r, s, x, y, i, j, ans, t, sum;

	cin >> n;
	
	ll a[n + 2];
	
	sum =0;
	for (i = 1; i <= n; i ++) {
		cin >> a[i];
		sum += a[i];
	}
	
	sort ( a + 1, a  + n + 1);
	reverse ( a + 1, a  + n + 1);
	
	double A, B, MX = 0.00, ANS_A, ANS_B, DIF;
	s = 0;
	for (i = 1; i <= n; i ++) {
		s += a[i];
		A = (i * 100.00)/n;
		B = (s * 100.00)/double(sum);
		DIF = B - A;
		if ( MX < DIF) {
			MX = DIF;
			ANS_A = A;
			ANS_B = B;
		}
	}
	printf("%.3lf\n", ANS_A);
	printf("%.3lf\n", ANS_B);
}
#Verdict Execution timeMemoryGrader output
Fetching results...