ÅÅ×ùÒÎ

#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
const int N = 1003;
typedef pair<int, int> PIR;

PIR r[N], c[N];
int res[N];

int main()
{
 int m, n, k, l, d;
 cin >> m >> n >> k >> l >> d;
 memset(r, 0, sizeof r);
 memset(c, 0, sizeof c);

 for (int i = 1; i <= m; i++)
  r[i].second  = i;
 for (int i = 1; i <= n; i++)
  c[i].second = i;

 while (d--)
 {
  int x1, y1, x2, y2;
  cin >> x1 >> y1 >> x2 >> y2;

  if (x1 == x2)
   c[min(y1, y2)].first ++;
  else
   r[min(x1, x2)].first ++;
 }
 sort(c, c + n+1), sort(r, r + m+1);

 for (int i = 0; i < k; i++)
  res[i]=r[m-i].second;
 sort(res, res + k);
 for (int i = 0; i < k; i++)
  cout << res[i] << ' ';
 cout << endl;
 memset(res, 0, sizeof res);
 for (int i = 0; i < l; i++)
  res[i]=c[n - i].second ;
 sort(res, res + l);
 for (int i = 0; i < l; i++)
  cout << res[i] << ' ';

 return 0;
}