5 solutions
-
0
#include <bits/stdc++.h> using namespace std; double a[305]; int main() { double n,d,x,p=0,j; cin>>n; for(int i=1;i<=n;i++) { cin>>a[i]; } d=a[1]; x=a[1]; for(int i=1;i<=n;i++) { if(d<a[i])d=a[i]; if(x>a[i])x=a[i]; } for(int i=1;i<=n;i++) { if(d==a[i]) { a[i]=-1; break; } } for(int i=1;i<=n;i++) { if(x==a[i]) { a[i]=-1; break; } } for(int i=1;i<=n;i++) { if(a[i]!=-1)p=p+a[i]; } j=0; for(int i=1;i<=n;i++) { if(j<abs(p/(n-2.0)-a[i]) && a[i]!=-1) { j=abs(p/(n-2.0)-a[i]); } } printf("%.2lf %.2lf",p/(n-2.0),j); }
Information
- ID
- 897
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 3
- Tags
- (None)
- # Submissions
- 229
- Accepted
- 40
- Uploaded By