#include <bits/stdc++.h>
#define int ll
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define rng(i,c,n) for(int i=c;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define vec(...) vector<__VA_ARGS__>
#define _3PGDklf ios::sync_with_stdio(0),cin.tie(0)
typedef long long ll;
using pii=pair<int,int>;
using vi=vector<int>;
void print(){cout<<'\n';}
template<class h,class...t>
void print(const h&v,const t&...u){cout<<v<<' ',print(u...);}
// e
signed main(){
_3PGDklf;
int n;
cin>>n;
vi a(n);
rep(i,n){
cin>>a[i];
}
int s=0;
rep(i,n){
s+=a[i];
}
sort(a.begin(), a.end());
using ld=long double;
ld now=0;
ld ma=0,optl=0;
per(i,n){
now+=a[i];
ld l=(ld)(n-i)/(ld)(n);
ld r=(ld)(now)/(ld)(s);
if(r-l>ma){
ma=r-l;
optl=l;
}
}
cout<<fixed<<setprecision(6);
cout<<optl<<"\n"<<ma+optl<<"\n";
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 2 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 3 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
| 4 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
| 5 |
Incorrect |
2 ms |
340 KB |
Output isn't correct |
| 6 |
Incorrect |
14 ms |
1108 KB |
Output isn't correct |
| 7 |
Incorrect |
30 ms |
1876 KB |
Output isn't correct |
| 8 |
Incorrect |
43 ms |
2644 KB |
Output isn't correct |
