50149. Admission

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

typedef struct{
    int id;
    int ch, en, ma, sc, ss;
    int total;
} student;

int m, n;
student arr[20005] = {0};

int cmp(const void* aa, const void* bb){
    student* a = (student*)aa;
    student* b = (student*)bb;
    if(a->total != b->total) return b->total - a->total;
    if(a->ma != b->ma) return b->ma - a->ma;
    if(a->en != b->en) return b->en - a->en;
    if(a->sc != b->sc) return b->sc - a->sc;
    if(a->ch != b->ch) return b->ch - a->ch;
    return b->ss - a->ss;
}

void get_info(student* s){
    scanf("%d %d %d %d %d %d", &s->id, &s->ch, &s->en, &s->ma, &s->sc, &s->ss);
    s->total = s->ch + s->en + s->ma + s->sc + s->ss;
}
int all_same(student* a, student* b){
    return (a->ch == b->ch) && (a->en == b->en) &&
           (a->ma == b->ma) && (a->sc == b->sc) &&
           (a->ss == b->ss);
}


int main(){
    scanf("%d %d", &m, &n);
    for(int i = 0; i < n; i++){
        student* s = &arr[i];
        get_info(s);
    }
    qsort(arr, n, sizeof(student), cmp);

    int qualify = m;
    student* last = &arr[m - 1];
    for(int i = m; i < n; i++){
        if(all_same(last, &arr[i])) qualify++;
        else break;
    }
    for(int i = 0; i < qualify; i++){
        printf("%d\n", arr[i].id);
    }
}