#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#define sqr 340
#define mid (l+r)/2
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define era erase
#define C continue
#define mem(dp,i) memset(dp,i,sizeof(dp))
#define mset multiset
typedef long long ll;
typedef short int si;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
const ll mod=1e9+7;
const ll inf=1e18;
const ld pai=acos(-1);
ll n,all,crnt;
ll a[300009];
ld calc(ll a,ll b){
return (ld)a/(ld)b*(ld)100.0;
}
int main(){
cin>>n;
for(int i=0;i<n;i++)cin>>a[i],all+=a[i];
sort(a,a+n);
reverse(a,a+n);
pair<ld,pair<ld,ld> >MX;
for(int i=0;i<n;i++){
crnt+=a[i];
ld A=calc(i+1,n);
ld B=calc(crnt,all);
MX=max(MX,{(ld)B-A,{(ld)A,(ld)B}});
}
cout<<setprecision(8)<<fixed<<MX.se.fi<<endl<<MX.se.se<<endl;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
248 KB |
Output is correct |
| 2 |
Correct |
5 ms |
376 KB |
Output is correct |
| 3 |
Correct |
5 ms |
376 KB |
Output is correct |
| 4 |
Correct |
6 ms |
376 KB |
Output is correct |
| 5 |
Correct |
10 ms |
504 KB |
Output is correct |
| 6 |
Correct |
52 ms |
1656 KB |
Output is correct |
| 7 |
Correct |
110 ms |
3192 KB |
Output is correct |
| 8 |
Correct |
156 ms |
4492 KB |
Output is correct |
