# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
82679 | 2018-11-01T10:17:48 Z | heon | Pareto (COCI17_pareto) | C++11 | 73 ms | 1784 KB |
#include<bits/stdc++.h> using namespace std; int main(){ int n; scanf("%d", &n); vector <int> v(n); int sum = 0; for(int i = 0; i < n; i++){ scanf("%d", &v[i]); sum += v[i]; } sort(v.rbegin(), v.rend()); int curr = 0; double a, b; double mx = -1.0, solb, sola; for(int i = 0; i < n; i++){ curr += v[i]; a = (double) (i+1) / n * 100.0; b = (double) curr / sum * 100.0; if(b - a > mx){ solb = b, sola = a; mx = b - a; } } cout << fixed << setprecision(10) << sola << "\n"; cout << fixed << setprecision(10) << solb; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 256 KB | Output is correct |
2 | Correct | 2 ms | 500 KB | Output is correct |
3 | Correct | 2 ms | 500 KB | Output is correct |
4 | Incorrect | 3 ms | 500 KB | Output isn't correct |
5 | Incorrect | 4 ms | 572 KB | Output isn't correct |
6 | Incorrect | 41 ms | 1000 KB | Output isn't correct |
7 | Incorrect | 53 ms | 1388 KB | Output isn't correct |
8 | Incorrect | 73 ms | 1784 KB | Output isn't correct |