1109 Group Photo -PAT甲级

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.

Sample Input:

10 3
Tom 188
Mike 170
Eva 168
Tim 160
Joe 190
Ann 168
Bob 175
Nick 186
Amy 160
John 159

Sample Output:

Bob Tom Joe Nick
Ann Mike Eva
Tim Amy John

这道题在左做的时候没有理清题意,以为是一行k个人,一直过不了所有的样例,后来才发现是k行,不过,按错误的理解竟然过了前三个样例。

先按照题目的意思排序,个子高的在前面,相同的话按照姓名的字典序的递增序列进行排序,最后一行的人可能多于每行的人数,需要进行特殊处理。

在解答的时候,没有用题中关于位置的限定m/2+1,利用了字符串的加法,理解起来相对容易,不过,用字符串写的代价就是时间消耗太多,好在是在时间的范围内,没有超时。 

满分代码如下:

#include<bits/stdc++.h>
using namespace std;
const int N=10100;
struct stu{
	string name;
	int hg;
	stu(){
	}
	stu(string nn,int hh){
		name=nn;
		hg=hh;
	}
	bool operator < (const stu &a)const{
		if(hg!=a.hg)
			return hg>a.hg;
		return name<a.name;	
	}
}st[N];
list<stu>ve[N];
int n,k;
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin>>n>>k;
	for(int i=1;i<=n;i++){
		cin>>st[i].name>>st[i].hg;
	}
	sort(st+1,st+n+1);
	int t=n/k;//每排的人数 
	int nn=n-t*(k-1);
	for(int i=1;i<=nn;i++){//按照从大到小的顺序排列的 
		ve[1].push_back(st[i]);
	}
	for(int i=nn+1,j=2;i<=n;i++){
		ve[j].push_back(st[i]);
		if((i-nn)%t==0){
			j++;
		}
	}
	for(int i=1;i<=k;i++){
		string s="",ss="";
		stu p=ve[i].front();
		s+=p.name;
		ve[i].pop_front();
		int dir=1;//1左0右
		while(!ve[i].empty()){
			stu q=ve[i].front();
			ve[i].pop_front();
			if(dir==1)
				ss=q.name+" "+s,s=ss;
			else
				ss=s+" "+q.name,s=ss;
			dir=1-dir;
		}
		cout<<s<<endl; 	
	}
	return 0;
}

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值