1109 Group Photo（25 分）

#include <iostream>
#include <string>
#include <map>
#include<vector>
#include<algorithm>
using namespace std;
#define STP system("pause")


struct node
{
    string name;
    int height;
};

int cmp(node a, node b) {
    return a.height != b.height ? a.height > b.height : a.name < b.name;
}
int main()
{
    int n, k, m, i, j;
    cin >> n >> k;
    vector<node>stu(n);
    for (int i = 0; i < n; i++)
    {
        cin >> stu[i].name >> stu[i].height;
    }
    sort(stu.begin(), stu.end(),cmp);

    int t = 0, row = k;
    while (row)
    {
        if (row==k)
        {
            m = n - n / k * (k - 1);
        }
        else
        {
            m = n / k;
        }

        vector<string>stemp(m);
        stemp[m / 2] = stu[t].name;

        j = m / 2 - 1;//左边一列
        for (int i = t+1; i < t+m; i+=2)
        {
            stemp[j--] = stu[i].name;
        }

        j = m / 2 + 1;//右边一列
        for (int i = t+2; i < t+m; i+=2)
        {
            stemp[j++] = stu[i].name;
        }

        cout << stemp[0];
        for (i = 1; i < m; i++)
        {
            cout << " " << stemp[i];
        }
        cout << endl;
        t += m;
        row--;
    }
    

    STP;
    return 0;
}