1 solutions

  • 0
    @ 2025-3-3 16:33:49

    C :

    #include<stdio.h>
    int main()
    {
    	int n;
    	scanf("%d",&n);
    	int i,k,t,j,a[n];
    	double s;
    	for(i=0;i<n;i++){
    		scanf("%d",&a[i]);
    	}
    	for(i=0;i<n-1;i++){
    		k=i;
    		for(j=i+1;j<n;j++){
    			if(a[j]<a[k]){
    				k=j;
    			}
    			if(k!=i){
    				t=a[i];
    				a[i]=a[k];
    				a[k]=t;
    			}
    		}
    	}
    	for(i=1;i<n-1;i++){
    		s+=a[i];
    	}
    	printf("%.2f",s/(n-2));
    	return 0;
    } 
    

    C++ :

    #include <iostream>
    #include <iomanip>
    using namespace std;
    int main(){
    	int n,i,max=0,min=10;
    	double s=0;
    	int a[10];
    	cin>>n;
    	for(i=0;i<n;i++){
    		cin>>a[i];
    	}
    	for(i=0;i<n;i++){
    		if(a[i]>max){
    			max=a[i];
    		}
    		if(a[i]<min){
    			min=a[i];
    		}
    	}
    	for(i=0;i<n;i++){
    		s=s+a[i];
    	}
    	s=(s-max-min)/(n-2)*1.00;
    	cout<<fixed<<setprecision(2)<<s<<endl;
    }
    

    Python :

    n=int(input())
    l1=list(map(int,input().split()))
    a=max(l1)
    b=min(l1)
    l1.remove(max(l1))
    l1.remove(min(l1))
    s=0
    for i in l1:
        s+=i
    c=s/(n-2)
    print('%.2f'% c)
    
    • 1

    Information

    ID
    10760
    Time
    1000ms
    Memory
    16MiB
    Difficulty
    (None)
    Tags
    # Submissions
    0
    Accepted
    0
    Uploaded By