oj.uz

답안 #24003

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
24003 2017-05-29T05:19:49 Z Trathz Pareto (COCI17_pareto) C++
80 / 80
 113 ms 4364 KB 
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define int long long
#define mp make_pair
#define pb push_back
#define pii pair<int, int>
#define ieps (int) 1e5 + 800
#define eps (int) 1e9
#define jmp exit(0)


double pct(int x , int y){
   return  1.0*x/y;
}


int32_t main(){
	int n ; 
	cin>>n;
	vector<int> v(n);
	int s =  0;
	for(int i = 0;i<n;i++) cin>>v[i] , s+=v[i];
	sort(v.rbegin() , v.rend());
    int atual = 0;
    pair<double , double > tot = mp(0, 0);
    for(int i = 0;i<n;i++){
        atual+=v[i];
        pair<double , double > l = mp(pct(i + 1 , n) , pct(atual,s));
        if(l.S - l.F> tot.S - tot.F){
        	tot = l;
        }
    } 
    	printf("%.10f\n%.10f", 100 * tot.F, 100 * tot.S);

}

Subtask #1
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2020 KB Output is correct
2 Correct 0 ms 2020 KB Output is correct
3 Correct 0 ms 2020 KB Output is correct
4 Correct 0 ms 2020 KB Output is correct
5 Correct 3 ms 2176 KB Output is correct
6 Correct 36 ms 2804 KB Output is correct
7 Correct 86 ms 3584 KB Output is correct
8 Correct 113 ms 4364 KB Output is correct