大佬帮忙看看

https://www.luogu.com.cn/record/133150603

using namespace std;
struct kkksc03{
	int id;
	int fenshu;
}qw[1010000],we[1010000]; 
int n,m,a,b,flag=1;
int sum,num=INT_MIN,ID,z=0;
bool cmp(kkksc03 q,kkksc03 w){
	return q.fenshu<w.fenshu;
}
int main()
{
	cin>>n>>m>>a>>b;
	for (int i=1;i<=a;i++){
		for (int j=1;j<=n;j++){
			scanf("%d",&sum);
			qw[j].fenshu+=sum;
			qw[j].id=j;
			if (i==b){
				if (sum>num)
				{
					num=sum;
					ID=qw[j].id;
				}
			}
		}
	}
	sort(qw+1,qw+n+1,cmp);
	for (int i=n;i>=1+m;i--){
		z++;
		we[z].id=qw[i].id;
		we[z].fenshu=qw[i].fenshu;
	}
	for (int i=1;i<=z;i++){
		if (we[i].id==ID) {
		flag=0;
		break;
		}
	}
	if (flag==0) {
		for (int i=1;i<=z-1;i++) cout<<we[i].id<<" ";
		cout<<ID;
	}
	else{
		we[z].id=ID;
		for (int i=1;i<=z;i++) cout<<we[i].id<<" ";
	}
	return 0;
}