PATA1109题解

排序题

//
//  main.cpp
//  PATA1109
//
//  Created by Phoenix on 2018/2/23.
//  Copyright © 2018年 Phoenix. All rights reserved.
//

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn = 10010;

struct Student {
    char name[10];
    int height;
}stu[maxn];

bool cmp(Student a, Student b) {
    if(a.height != b.height) return a.height > b.height;
    else return strcmp(a.name, b.name) < 0;
}

int main(int argc, const char * argv[]) {
    int n, k;
    scanf("%d %d ", &n, &k);
    for(int i = 0; i < n; i++) {
        scanf("%s %d", stu[i].name, &stu[i].height);
    }
    sort(stu, stu + n, cmp);
    for(int i = 0; i < n; i++) {
        //printf("%s %d\n", stu[i].name, stu[i].height);
    }
    int l = n / k;
    int m = n % k + l, num = 0;
    int G[k][m];
    int i = m / 2;
    int j = i - 1;
    while (j >= 0 || i < m) {
        if(i < m) G[0][i++] = num++;
        if(j >= 0) G[0][j--] = num++;
    }
    for(int i = 0; i < m; i++) {
        printf("%s", stu[G[0][i]].name);
        if(i < m - 1) printf(" ");
        else printf("\n");
    }
    for(int t = 1; t < k; t++) {
        int i = l / 2;
        int j = i - 1;
        while (j >= 0 || i < l) {
            if(i < l) G[t][i++] = num++;
            if(j >= 0) G[t][j--] = num++;
        }
        for(int i = 0; i < l; i++) {
            printf("%s", stu[G[t][i]].name);
            if(i < l - 1) printf(" ");
            else printf("\n");
        }
    }
    return 0;
}