NC16618 排座椅(贪心)

题目链接

题意：
$n\ast m的座位，有d对同学互相交头接耳$
$可以隔开k行和l列，隔开之后就不会再交头接耳$
$问隔开哪些行列可以使得交头接耳同学最少$
题解：
$由于行和列，每行，每列交头接耳的同学是独立的$
$所以直接贪心，考虑每行能隔开多少交头接耳的同学$
$处理完之后，找前k大的行和前l大的列进行隔开$
$这样就可以最小化交头接耳的同学$
$由于要写升序，所以用个vector存一下排个序$
AC代码

/*
    Author : zzugzx
    Lang : C++
    Blog : blog.csdn.net/qq_43756519
*/
#include<bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define endl '\n'
#define SZ(x) (int)x.size()
#define mem(a, b) memset(a, b, sizeof(a))

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int mod = 1e9 + 7;
//const int mod = 998244353;

const double eps = 1e-6;
const double pi = acos(-1.0);
const int maxn = 1e6 + 10;
const int N = 3e3 + 5;
const ll inf = 0x3f3f3f3f;
const int dir[][2]={{0, 1}, {1, 0}, {0, -1}, {-1, 0}, {1, 1}, {1, -1}, {-1, 1}, {-1, -1}};
int xx[maxn], yy[maxn], id[maxn];
bool cmp1(int i, int j) {
    return xx[i] > xx[j];
}
bool cmp2(int i, int j) {
    return yy[i] > yy[j];
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
//  freopen("in.txt", "r", stdin);
//  freopen("out.txt", "w", stdout);
    int n, m, k, l, _;
    cin >> n >> m >> k >> l >> _;
    while (_--) {
        int x, y, x1, y1;
        cin >> x >> y >> x1 >> y1;
        if (y == y1)
            xx[min(x, x1)]++;
        else
            yy[min(y, y1)]++;
    }
    for (int i = 1; i <= n; i++) id[i] = i;
    sort(id + 1, id + 1 + n, cmp1);
    vector<int> ans;
    for (int i = 1; i <= k; i++)
        ans.pb(id[i]);
    sort(all(ans));
    for (int i = 0; i < ans.size(); i++)
        cout << ans[i] << " \n"[i == ans.size() - 1];

    for (int i = 1; i <= m; i++) id[i] = i;
    sort(id + 1, id + 1 + m, cmp2);
    ans.clear();
    for (int i = 1; i <= l; i++)
        ans.pb(id[i]);
    sort(all(ans));
    for (int i = 0; i < ans.size(); i++)
        cout << ans[i] << " \n"[i == ans.size() - 1];
    return 0;
}