oj.uz

Submission #873623

# Submission time Handle Problem Language Result Execution time Memory
873623 2023-11-15T11:46:11 Z vjudge1 Pareto (COCI17_pareto) C++17
80 / 80
 83 ms 7516 KB 
#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")

#define tof_io  ios_base::sync_with_stdio(false);cin.tie(0) , cout.tie(0);
#define double  long double
#define int     long long
#define pb      push_back

#define all(x)  x.begin(),x.end()
#define endl    '\n'
#define sz(x) 	x.size()
//const int mod = 998244353; //998244353 1e9+7 1e9+9
const int N = 5e3 + 23;	
const int lg = 23;
const int inf = 2e18;
int fac[N];
int inv[N];
double cnt1 = 0.0;
//int  dnt_pow	(int a, int b, int md = mod){int ans = 1; while(b){if(b&1){ans = (a*ans)%md;}a = (a*a)%md;b >>= 1;}return ans ;}
//void dnt_bld	(){fac[0] = 1; inv[0] = dnt_pow(fac[0],mod-2) ;for(int i = 1 ; i < N ; i++) {fac[i] = (fac[i-1] * i) % mod;inv[i] = dnt_pow( fac[i] , mod-2);}}
//int  dnt_ncr	(int r,int n){if(r>n) return 0; return fac[n] * inv[r] % mod * inv[n-r] % mod;}

int32_t main () 
{
	int n;
	cin >> n;
	vector<int> acc(n);
	int sm = 0;
	vector<int> smd1(n);
	for(int i = 0; i < n; i++)
	{
		cin >> acc[i] ; 
		if(i==0) smd1.pb(acc[i]);
		else smd1.pb(acc[i] + smd1[i-1]);
		sm = sm + acc[i];
	}
	sort(all(acc));
	double A = 100.0;
	double B = -1.0;
	double smd = 0.0;
	for (int i = n - 1; i >= 0; i--)
	{
		cnt1 = n - i;
        cnt1 = cnt1 / ((double)n / 100);
        smd  = smd + acc[i];
        double y = smd;
        y /= (double)sm / 100;
        if(B - A < y - cnt1)
        {
            A = cnt1;
            B = y;
        }
	}
	cout << A << endl << B;
}

Subtask #1
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 3 ms 604 KB Output is correct
6 Correct 27 ms 2652 KB Output is correct
7 Correct 55 ms 4952 KB Output is correct
8 Correct 83 ms 7516 KB Output is correct