深基7.例4歌唱比赛

0
Guest MOD
- Guest
2
刘丛睿 (lqst2025013) LV 8 MOD @ 2026-3-25 17:58:08

#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }

梶 (lqst2505) LV 7 MOD @ 2026-3-25 17:56:50

#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}

2
梶 (lqst2505) LV 7 MOD @ 2026-3-25 17:55:55

911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com

lqst2026001 (lqst2025020) LV 7 MOD @ 2026-3-25 17:35:15

#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s,u,max=0,min=10,sum=0;
	double mmax=0;
	int a[21]={0};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s;
			a[j]=s;
			if(s>=max) max=s;
			if(s<=min) min=s;
		}
		for(int t=1;t<=m;t++){
			sum+=a[t];
		}
		sum=sum-max-min;
		u=sum/(m-2);
		if(u>=mmax) mmax=u;
		max=0;
		min=10;
		sum=0;
	}
	printf("%.2lf",mmax);
	return 0;
}

1
梶 (lqst2505) LV 7 MOD @ 2026-3-25 18:01:55
1. [ ] ````language`c++ #include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }
#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }

#include<bits/stdc++.h> using namespace std; const int N=1e4+10,M=998244353; int n,m,a; string s; double p,p2; signed main(){ cin>>n>>m; for(int i=1;i<=n;i++){ int maxx=-1,minn=N100;p=0; for(int j=1;j<=m;j++){ cin>>a; maxx=max(maxx,a); minn=min(minn,a); p+=a; }p=(p-maxx-minn)/(m-2); // p2=(p2-maxx-minn)/(m-2); p2=max(p,p2); }printf("%.2lf",p2); //(p-maxx-minn)/(nm-2) return 0; }
1
刘丛睿 (lqst2025013) LV 8 MOD @ 2026-3-25 17:58:33

#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }
0
梶 (lqst2505) LV 7 MOD @ 2026-3-25 17:56:27

#include<bits/stdc++.h> using namespace std; int main(){ int n,m,s,u,max=0,min=10,sum=0; double mmax=0; int a[21]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>s; a[j]=s; if(s>=max) max=s; if(s<=min) min=s; } for(int t=1;t<=m;t++){ sum+=a[t]; } sum=sum-max-min; u=sum/(m-2); if(u>=mmax) mmax=u; max=0; min=10; sum=0; } printf("%.2lf",mmax); return 0; }
0
梶 (lqst2505) LV 7 MOD @ 2026-3-25 17:56:15

911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com 911.com

-1

yangzijian_lq LV 5 MOD @ 2026-3-25 17:59:02

允许sort

#include<bits/stdc++.h>
using namespace std;
int awa[30];
int main(){
	int n;
	cin>>n;
	string s;
	cin>>s;
	if(s.size()>200){
		cout<<0;
		return 0;
	}
	int ans=0;
	for(int i=0;i<s.size();i++){
		if(s[i]=='?'){
			ans++;
			continue;
		}
		awa[s[i]-'a'] ++;
	}
	for(int i=0;i<s.size();i++){
		if(s[i]=='?')continue;
		if(awa[s[i]-'a']>s.size()/2){
			cout<<0;
			return 0;
		}
	}
	int cnt=0;
	for(int i=0;i<s.size();i++){
		if(s[i]=='?') continue;
		if(awa[s[i]-'a']) cnt++;
	}
	cout<<(26-cnt)*ans;
	return 0;
}

M14射手步枪-烽火地带-6HD6BAO05HM4BUJB03F3S 点击复制包好用的

-1

yangzijian_lq LV 5 MOD @ 2026-3-25 17:58:25

允许sort

#include<bits/stdc++.h>
using namespace std;
int awa[30];
int main(){
	int n;
	cin>>n;
	string s;
	cin>>s;
	if(s.size()>200){
		cout<<0;
		return 0;
	}
	int ans=0;
	for(int i=0;i<s.size();i++){
		if(s[i]=='?'){
			ans++;
			continue;
		}
		awa[s[i]-'a'] ++;
	}
	for(int i=0;i<s.size();i++){
		if(s[i]=='?')continue;
		if(awa[s[i]-'a']>s.size()/2){
			cout<<0;
			return 0;
		}
	}
	int cnt=0;
	for(int i=0;i<s.size();i++){
		if(s[i]=='?') continue;
		if(awa[s[i]-'a']) cnt++;
	}
	cout<<(26-cnt)*ans;
	return 0;
}

M14射手步枪-烽火地带-6HD6BAO05HM4BUJB03F3S 点击复制包好用de

ID

1638

Time

1000ms

Memory

256MiB

Difficulty

Tags

# Submissions

Accepted

Uploaded By

lfy24

10 solutions

Information

Status

Development

Support