5 solutions
-
-2
#include<bits/stdc++.h> using namespace std; const int N=310; double a[N]; int main() { int n; cin>>n; int maxid,minid; double sum=0; for (int i=1;i<=n;i++) { cin>>a[i]; if (i==1 || a[i]>a[maxid]) { maxid=i; } if (i==1 || a[i]<a[minid]) { minid=i; } sum+=a[i]; } sum=sum-a[maxid]-a[minid]; double ave=sum/(n-2); double res=0; for (int i=1;i<=n;i++)// { if (i==maxid || i==minid) continue; double t=abs(a[i]-ave); if (t>res) { res=t; } } cout<<fixed<<setprecision(2)<<ave<<" "<<res; return 0; }
Information
- ID
- 897
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 3
- Tags
- (None)
- # Submissions
- 229
- Accepted
- 40
- Uploaded By