|段错误扩大数组范围|7-11 互评成绩 (25分)

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
using namespace std;

//int maxS=0,minS=100;
//int maxN[10010]={0};
//int minN[10010]={0};
int score[10010];
int sum[10000];

bool cmp(int a,int b){
    return a>b;
}
int main()
{
    int n,k,m;
    //cin>>n>>k>>m;//6 5 3
    scanf("%d %d %d",&n,&k,&m);
    for(int i=0;i<n;i++){
        memset(score,0,sizeof(score));
        for(int j=0;j<k;j++){
              //int tmp;
              //cin>>tmp;
              /*if(tmp>=maxS){
                  maxS=tmp;
              }
              if(tmp<=minS){
                  minS=tmp;
              }
              maxN[i]=maxS;
              minN[i]=minS;*/
              //course[i].push(tmp);
              //score[i]=tmp;
              scanf("%d",&score[j]);
              sum[i]+=score[j];
        }
        sort(score,score+k);//小---大
        sum[i]=sum[i]-score[0]-score[k-1];
    }
    sort(sum,sum+n,cmp);//n=6//m=3//123//012
    for(int i=m-1;i>=0;i--){
        if(i==m-1)
            printf("%.3f",sum[i]*1.0/(k-2));
        else
            printf(" %.3f",sum[i]*1.0/(k-2));
    }
    return 0;
}