# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
596401 | p41nt | Pareto (COCI17_pareto) | C++17 | 44 ms | 4192 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &x) {
cerr << '{';
__print(x.first);
cerr << ',';
__print(x.second);
cerr << '}';
}
template <typename T>
void __print(stack<T> &x, int f = 0) {
cerr << (!f ? "{" : "");
if (x.empty()) {
cerr << '}';
return;
}
auto k = x.top();
x.pop();
cerr << (f++ ? "," : "");
__print(k);
__print(x, f);
x.push(k);
}
template <typename T>
void __print(const T &x) {
int f = 0;
cerr << '{';
for (auto &i : x) cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
__print(t);
if (sizeof...(v)) cerr << ", ";
_print(v...);
}
#ifndef ONLINE_JUDGE
#define debug(x...) \
cerr << "[" << #x << "] = ["; \
_print(x)
#else
#define debug(x...)
#endif
#define int long long int
#define endl "\n"
void solve() {
int n;
cin >> n;
int sum = 0;
vector<int> arr(n);
for (int i = 0; i < n; i++) {
cin >> arr[i];
sum += arr[i];
}
sort(arr.begin(), arr.end(), greater<int>());
double a = 0, b = 0;
int s = 0;
for (int i = 0; i < n; i++) {
double ta = (i + 1) / (double)n * 100;
s += arr[i];
double tb = s / (double)sum * 100;
if (tb - ta > b - a) a = ta, b = tb;
}
cout << a << endl << b << endl;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
//================================================================
int t = 1;
// cin >> t;
while (t--) {
solve();
}
//================================================================
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |