题解 | 排座椅

#include <stdio.h>
#include <stdlib.h>

typedef struct {
    int index;
    int count;
}Stu;

int cmp_index(const void*a, const void*b){
    const Stu*sa = (const Stu*)a;
    const Stu*sb = (const Stu*)b;
    return sa->index - sb->index;
}

int cmp_count(const void*a, const void*b){
    const Stu*sa = (const Stu*)a;
    const Stu*sb = (const Stu*)b;
    return sb->count - sa->count;
}

int main(void) {
    int n, m, k, l, d;
    scanf("%d%d%d%d%d", &n, &m, &k, &l, &d);

    int x, y, p, q;
    Stu col[1005] = { 0 }, row[1005] = { 0 };
    int min_cur;

    for(int i = 1; i < n; i++)
        row[i].index = i;
    for(int j = 1; j < m; j++)
        col[j].index = j;

    for(int i = 0; i < d; i++){
        scanf("%d%d%d%d", &x, &y, &p, &q);
        if(x == p){
            if(y < q)   min_cur = y;
            else    min_cur = q;
            col[min_cur].count++;
        }
        if(y == q){
            if(x < p)   min_cur = x;
            else    min_cur = p;
            row[min_cur].count++;
        }
    }
    qsort(row+1, n-1, sizeof(Stu), cmp_count);
    qsort(col+1, m-1, sizeof(Stu), cmp_count);

    int row_count = k < n-1 ? k : n-1;
    int col_count = l < n-1 ? l : n-1;
    qsort(row+1, row_count, sizeof(Stu), cmp_index);
    qsort(col+1, col_count, sizeof(Stu), cmp_index);

    for(int i = 1; i <= row_count; i++)
        printf("%d ", row[i].index);
    printf("\n");
    for(int j = 1; j <= col_count; j++)
        printf("%d ", col[j].index);
    return 0;
}