# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
597105 | kabika | Pareto (COCI17_pareto) | C++14 | 47 ms | 4196 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;
typedef long long ll;
typedef long double ld;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<ll> m(n,0);
ll tot = 0;
for(int i = 0; i < n; ++i)
{
cin >> m[i];
tot += m[i];
}
sort(m.begin(),m.end(),greater<ll>());
ll temp = 0;
ld diff = 0;
ld a = 0, b = 0;
for(int i = 0; i < n; ++i)
{
temp += m[i];
ld ta = (i+1)*100.0/n;
ld tb = temp*100.0/tot;
if(tb-ta >= diff)
{
b = tb;
a = ta;
diff = b-a;
}
}
cout << a << '\n' << b << '\n';
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |