代码↓ 只有80分

#include <bits/stdc++.h>
using namespace std;
int m,n,k,l,d;
const int MN=2e3+213;
struct Side{
	int node;
	int cnt;
};
Side sidex[MN],sidey[MN];
bool cmp(Side shuxue, Side wuli){
	return shuxue.cnt>wuli.cnt; 
}
bool cmp_gather(Side shuxue, Side wuli){
	return shuxue.node<wuli.node;
}
int main(){
	scanf("%d%d%d%d%d",&m,&n,&k,&l,&d);
	for(int i=1; i<=MN; i++){
		sidex[i].node=i;
		sidey[i].node=i;
	}
	for(int i=1; i<=d; i++){
		int xx,xxx,yy,yyy;
		scanf("%d%d%d%d",&xx,&yy,&xxx,&yyy);
		if(xx==xxx){
			sidey[min(yy,yyy)].cnt++;
		}else{
			sidex[min(xx,xxx)].cnt++;
		}
	}
	sort(sidex+1,sidex+m+1,cmp);
	sort(sidex+1,sidex+k+1,cmp_gather);
	sort(sidey+1,sidey+n+1,cmp);
	sort(sidey+1,sidey+l+1,cmp_gather);
	for(int i=1; i<=k; i++){
		cout<<sidex[i].node<<" ";
	}
	cout<<endl;
	for(int i=1; i<=l; i++){
		cout<<sidey[i].node<<" ";
	}
	return 0;
}