[NOIP2008]排座椅

// Problem: [NOIP2008]排座椅
// Contest: NowCoder
// URL: https://ac.nowcoder.com/acm/contest/20960/1044
// Memory Limit: 102400 MB
// Time Limit: 2000 ms
// 2022-03-03 19:53:02
// 
// Powered by CP Editor (https://cpeditor.org)

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

#define rep(i,l,r) for(int i=(l);i<=(r);i++)
#define per(i,l,r) for(int i=(l);i>=(r);i--)
#define ll long long
#define pii pair<int, int>
#define mset(s,t) memset(s,t,sizeof(t))
#define mcpy(s,t) memcpy(s,t,sizeof(t))
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define mp make_pair

const ll mod = 1e9 + 7;

inline ll qmi (ll a, ll b) {
	ll ans = 1;
	while (b) {
		if (b & 1) ans = ans * a%mod;
		a = a * a %mod;
		b >>= 1;
	}
	return ans;
}
inline int read () {
	int x = 0, f = 0;
	char ch = getchar();
	while (!isdigit(ch)) f |= (ch=='-'),ch= getchar();
	while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
	return f?-x:x;
}
template<typename T> void print(T x) {
	if (x < 0) putchar('-'), x = -x;
	if (x >= 10) print(x/10);
	putchar(x % 10 + '0');
}
inline ll sub (ll a, ll b) {
	return ((a - b ) %mod + mod) %mod;
}
inline ll add (ll a, ll b) {
	return (a + b) %mod;
}
inline ll inv (ll a) {
	return qmi(a, mod - 2);
}

const int N = 1e5 + 10;
int n, m, k, l, d;
pii col[N], row[N];
bool cmp (pii a, pii b) {
    if (a.se != b.se) return a.se > b.se;
    return a.fi < b.fi;
}
void solve() {
	cin >> n >> m >> k >> l >> d;
    for (int i = 1; i <= d; i ++) {
        int x1, y1, x2, y2;
        cin >> x1 >> y1 >> x2 >> y2;
        if (x1 == x2) {
            int mid = y1 + y2 >> 1;
            col[mid].fi = mid;
            col[mid].se++;
        }
        else {
             int mid = x1 + x2 >> 1;
            row[mid].fi = mid;
            row[mid].se++;
        } 
    }
    sort(row + 1, row + 1 + n, cmp);
    sort(row + 1, row + 1 + k);
    for (int i = 1; i<= k; i ++) {
        cout << row[i].fi << " ";
    }
    puts("");
   sort(col + 1, col + 1 + m, cmp);
    sort(col + 1, col + 1 + l);
    for (int i = 1; i<= l; i ++) {
        cout << col[i].fi << " ";
    }
    
}
int main () {
    int t;
    t =1;
    //cin >> t;
    while (t --) solve();
    return 0;
}

贪心的选择坐标中间。首先对x进行讨论，如果相同，就在列的中间放，否则在行的中间放