80分求助

#include<bits/stdc++.h>
using namespace std;
int n,k,a;
struct aya{
	int num,m;
	double aa;
}x[101];
bool cmp(aya o,aya p){
	if(o.aa!=p.aa) return o.aa>p.aa;
	return o.aa<p.aa;
} 
int main(){
	cin>>n>>k;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=k;j++) cin>>a,x[i].m+=a;
		x[i].num=i,x[i].aa=1.0*x[i].m/k;
	} 
	sort(x+1,x+n+1,cmp);
	cout<<x[1].num<<'\n'<<x[2].num;
	return 0;
}