oj.uz

답안 #105915

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
105915 2019-04-15T16:32:00 Z leonarda Pareto (COCI17_pareto) C++14
80 / 80
 68 ms 5088 KB 
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define F first
#define S second
typedef pair<int, int> pi;
typedef long long int lint;
const int inf = 0x3f3f3f3f;
const int maxn = 3 * 1e5;

int n;
lint a[maxn];
lint sum[maxn];
double x, y, maks;

bool komp(lint t1, lint t2) {
	return t1 > t2;
}

int main ()
{
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	
	cin >> n;
	for(int i = 0; i < n; ++i)
		cin >> a[i];
	
	sort(a, a + n, komp);
	
	sum[0] = a[0];
	for(int i = 1; i < n; ++i)
		sum[i] = sum[i - 1] + a[i];
	
	for(int i = 0; i < n; ++i) {
		double pare = (double)sum[i] / (double)sum[n - 1] * 100;
		double ljudi = (double)(i + 1) / (double)n * 100;
		
		if(pare - ljudi > maks) {
			maks = pare - ljudi;
			x = pare;
			y = ljudi;
		}
	}
	
	cout << setprecision(10) << y << endl << setprecision(10) << x;

return 0;
}

Subtask #1
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 5 ms 512 KB Output is correct
6 Correct 23 ms 1912 KB Output is correct
7 Correct 51 ms 3496 KB Output is correct
8 Correct 68 ms 5088 KB Output is correct