5 solutions
-
0
#include<bits/stdc++.h> using namespace std; int main(){ int n,f=0,g=0,k=0,l=0; cin>>n; double a[305]; for(int i=1;i<=n;i++) { cin>>a[i]; } double s=0; for(int i=1;i<=n;i++) { g++; if(a[i]>=s) { s=a[i]; f=g; } } double x=1000000.0; for(int i=1;i<=n;i++) { k++; if(a[i]<=x) { x=a[i]; l=k; } } double y=0.0; for(int j=1;j<=n;j++) { y+=a[j]; } y-=s+x; printf("%.2lf ",double(y/(n-2))); double b=0.1; for(int z=1;z<=n;z++) { if(a[z]>=b && z!=f) b=a[z]; } double c=10000.0; for(int h=1;h<=n;h++) { if(a[h]<=c && h!=l) c=a[h]; } double d=abs(c-y/(n-2.0)); double e=abs(b-y/(n-2.0)); if(d>=e) { printf("%.2lf",d); } else { printf("%.2lf",e); } return 0; }
Information
- ID
- 897
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 3
- Tags
- (None)
- # Submissions
- 359
- Accepted
- 70
- Uploaded By