求求，有没有人知道错在哪里

样例对了，但只有 $10$ 分

#include <bits/stdc++.h>
using namespace std;

const int maxn = 1e3 + 5;

struct book {
	int body;
	int line1;
}hang[maxn];

struct book1 {
	int body;
	int line2;
}lie[maxn];

bool cmp1(book x, book y) {
	return x.body > y.body;
}

bool cmp2(book1 x, book1 y) {
	return x.body > y.body;
}

int main() {
	int m, n, k, l, d;
	
	cin >> m >> n >> k >> l >> d;
	for (int i = 1; i <= d; i++) {
		int x, y, p, q;
		
		cin >> x >> y >> p >> q;
		
		if (x == p) {
			lie[min(y, q)].body++;
		}
		else if (y == q) {
			hang[min(x, p)].body++;
		}
	}
	
	for (int i = 1; i < m; i++) {
		hang[i].line1 = i;
	}
	for (int i = 1; i < n; i++) {
		lie[i].line2 = i;
	}
	
	sort(hang + 1, hang + m, cmp1);
	sort(lie + 1, lie + n, cmp2);
	
	for (int i = 1; i <= k; i++) {
		cout << hang[i].line1 << " ";
	}
	cout << endl;
	for (int i = 1; i <= l; i++) {
		cout << lie[i].line2 << " ";
	}
	cout << endl;
	
	return 0;
}