用的正常方法

#include<cstdio> #include<iostream> #include<cmath> using namespace std; int main(){ int a,b=0,e=114514,f=0; for(int i=1;i<=4;i++){ cin>>a; if(a>f)f=a; if(a<e)e=a; b+=a; } printf("%.2f",(b-f-e)*1.0/2); return 0; }

#include <bits/stdc++.h> using namespace std; int a,b,c,d,sum; int main() { cin>>a>>b>>c>>d; sum=a+b+c+d; int maxx,minn; maxx=max(max(max(a,b),c),d); minn=min(min(min(a,b),c),d); printf("%.2f",(sum-minn-maxx)/(2.00)); return 0; }

//#include<iostream> #include<cstdio> #include<algorithm> //#include<cmath> //#include<string.h> using namespace std; int main() { int a,b,c,d; scanf("%d%d%d%d",&a,&b,&c,&d); double sum=a+b+c+d; sum=sum-max(max(a,b),max(c,d))-min(min(a,b),min(c,d)); printf("%.2f",sum/2); return 0; }

#include<iostream> using namespace std; int main(){ int a,d=0,x=10000; float n=0; for(int i=0;i<4;i++){ cin>>a; n+=a; if(a>d) {d=a;} if(a<x) {x=a;} } n=n-d-x; printf("%.2f",n/2*1.0); return 0; }

#include<bits/stdc++.h> using namespace std; int main() { int a[5]={}; float ans=0; int max=0; int min=1000; for(int i=0;i<4;i++) { cin>>a[i]; ans+=a[i]; if(a[i]>max) { max=a[i]; } if(a[i]<min) { min=a[i]; } } ans-=max; ans-=min; ans/=2; printf("%.2f",ans); }