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 (<=10000), 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.
Sample Input:10 3 Tom 188 Mike 170 Eva 168 Tim 160 Joe 190 Ann 168 Bob 175 Nick 186 Amy 160 John 159Sample Output:
Bob Tom Joe Nick Ann Mike Eva Tim Amy John
也是排队的问题。规则n个人是分成k排,每一排为n/k(取整)个人,然后剩余的人全放在最后一排,同时要符合后面排的比前面排的都要高(所以最高的在最后一排,一直往上排)。注意输出的时候是倒过来输出,即最后一排先输出,第一排最后输出。对于每一排,高的站中间,矮的站两边,故最高的放在中间(假设当前排为m人,最高的在m/2-1的位置),然后第二高的放中间的左边,第三高放中间的右边......根据这个规律,先对这些人进行排序,然后给每一排分配人即可。
代码:
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
struct people
{
string name;
int height;
};
bool cmp(const people &p1,const people &p2)
{
if(p1.height!=p2.height) return p1.height>p2.height;
else return p1.name<p2.name;
}
int main()
{
int n,k;
cin>>n>>k;
int m=n/k;
int last=m+n-m*k;
vector<people>ps(n);
for(int i=0;i<n;i++)
{
cin>>ps[i].name>>ps[i].height;
}
sort(ps.begin(),ps.end(),cmp);
int idx=0;
for(int i=0;i<k;i++)
{
int rowsize;
if(i==0) rowsize=last;
else rowsize=m;
vector<string>row(rowsize);
int mid=rowsize/2;
row[mid]=ps[idx++].name;
int l=mid-1,r=mid+1;
while(l>=0&&r<rowsize)
{
row[l--]=ps[idx++].name;
row[r++]=ps[idx++].name;
}
if(l==0) row[l]=ps[idx++].name;
cout<<row[0];
for(int j=1;j<row.size();j++)
{
cout<<" "<<row[j];
}
cout<<endl;
}
}