1.这道题初看题意复杂，其实很简单的排序问题。
2.要注意用vector的时候一定不要多给，少给了会vector out of ....,但多给了不容易看出来，要多少给多少，我就是因为多给了导致排序出来得结果有两个空node
代码：
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
struct node{
string name;
int high;
};
vector<int> row;
vector<node> sp;
vector<vector<string> > a;
bool cmp(node a,node b)
{
if (a.high != b.high)return a.high < b.high;
else{
return a.name > b.name;
}
}
int main()
{
int n, k;
cin >> n >> k;
row.resize(k+2);
int per = n / k;
int last = n - per*(k - 1);
for (int i = 1; i <= k; i++)
{
if (i != k)row[i] = per;
else row[i] = last;
}
sp.resize(n);
for (int i = 0; i < n; i++)
{
cin >> sp[i].name >> sp[i].high;
}
sort(sp.begin(), sp.end(), cmp);
int max1 = n - 1;
a.resize(k+5);
for (int i = k; i >= 1; i--)
{
a[i].resize(row[i]+5);
int p = row[i] / 2; p++;//最佳位置
int peo = row[i];//人数
int sq = peo; //判断
if (p >= 1 && p <= peo){
a[i][p] = sp[max1--].name; sq--;
}
int s = 1;
while (sq>0)
{
if (p - s >= 1){ a[i][p - s] = sp[max1--].name; sq--; }
if (p + s <= peo){ a[i][p + s] = sp[max1--].name; sq--; }
s++;
}
}
for (int i = k; i >= 1; i--)
{
for (int j = 1; j <= row[i]; j++)
{
cout << a[i][j];
if (j != row[i])cout << " ";
}
if (i != 1)cout << endl;
}
return 0;
}