1109 Group Photo (25分)

Formation is very important when taking a group photo. Given the rules of forming K rows with N people as the following:
The number of people in each row must be N/K (round down to the nearest integer), with all the extra people (if any) standing in the last row;
All the people in the rear row must be no shorter than anyone standing in the front rows;
In each row, the tallest one stands at the central position (which is defined to be the position (m/2+1), where m is the total number of people in that row, and the division result must be rounded down to the nearest integer);
In each row, other people must enter the row in non-increasing order of their heights, alternately taking their positions first to the right and then to the left of the tallest one (For example, given five people with their heights 190, 188, 186, 175, and 170, the final formation would be 175, 188, 190, 186, and 170. Here we assume that you are facing the group so your left-hand side is the right-hand side of the one at the central position.);
When there are many people having the same height, they must be ordered in alphabetical (increasing) order of their names, and it is guaranteed that there is no duplication of names.
Now given the information of a group of people, you are supposed to write a program to output their formation.

Input Specification:

Each input file contains one test case. For each test case, the first line contains two positive integers N (≤10^​4​​), the total number of people, and K (≤10), the total number of rows. Then N lines follow, each gives the name of a person (no more than 8 English letters without space) and his/her height (an integer in [30, 300]).

Output Specification:

For each case, print the formation – that is, print the names of people in K lines. The names must be separated by exactly one space, but there must be no extra space at the end of each line. Note: since you are facing the group, people in the rear rows must be printed above the people in the front rows.

将整体按身高从大到小排序，然后分成k行，对每行处理后输出。

对每一行的处理：例如一行有五个人，身高分别为5、4、3、2、1，按下标（从0开始）的奇偶分成两部分：{5、3、1}与{4、2}，先将{4，2}逆序输出，然后将{5、3、1}顺序输出，即可得到正确结果2、4、5、3、1。

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
struct peo {
	string name;
	int height;
};
void ans(vector<peo>v, int start, int end) {
	vector<peo>odd, even;
	for (int i = start; i <= end; i++) {
		if ((i-start) % 2 == 0)odd.push_back(v[i]);//这里奇偶应该是写反了，不过没有影响
		else
			even.push_back(v[i]);
	}
	if(even.size()>0)cout << even[even.size()-1].name;//even可能为空，有一个测点与此相关
	for (int i = even.size() - 2; i >= 0; i--)cout << " " << even[i].name;
	for (int i = 0; i < odd.size(); i++) {
		if (even.size() == 0 && i == 0)cout << odd[i].name;
		else
			cout << " " << odd[i].name;
	}
	cout << endl;
}
bool cmp(peo p1, peo p2) {
	if (p1.height != p2.height)return p1.height > p2.height;
	else
		return p1.name < p2.name;
}
int main() {
	int n, m, k;
	cin >> n >> k;
	m = n / k;
	vector<peo>v;
	for (int i = 0; i < n; i++) {
		string s;
		int h;
		cin >> s >> h;
		v.push_back({ s,h });
	}
	sort(v.begin(), v.end(), cmp);
	ans(v, 0, v.size() % k + m - 1);
	int temp = v.size() % m + m;
	for (int i = 1; i < k; i++) {
		ans(v, temp, temp + m - 1);
		temp += m;
	}
	return 0;
}

一开始没仔细看题目，把k当成每行的人数了，好几个测点错了。