标签：思路 tput div code where pen cst ide stream
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.
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]).
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.
10 3
Tom 188
Mike 170
Eva 168
Tim 160
Joe 190
Ann 168
Bob 175
Nick 186
Amy 160
John 159
Bob Tom Joe Nick
Ann Mike Eva
Tim Amy John
分析：一开始想的是把左右两边都排序一次，但感觉较复杂且肯定耗时大，后来还是参考了柳神的代码。。思路清晰。。
具体做法：每排一个大循环，最大的先插入，两侧的按序一个个插入，插入过程中i=i+2，注意跳出条件。
1 #include<cstdio> 2 #include<cstring> 3 #include<iostream> 4 #include<cmath> 5 #include<algorithm> 6 #include<vector> 7 using namespace std; 8 struct student{ 9 string name; 10 int h; 11 }; 12 13 bool cmp(student a,student b){ 14 if(a.h!=b.h) return a.h>b.h; 15 else if(a.name!=b.name) return a.name<b.name; 16 } 17 18 int main() 19 { 20 #ifdef ONLINE_JUDGE 21 #else 22 freopen("1.txt", "r", stdin); 23 #endif 24 int n,k,i,j,m; 25 cin>>n>>k; 26 vector<student> stu(n); 27 for(i=0;i<n;i++){ 28 cin>>stu[i].name>>stu[i].h; 29 } 30 sort(stu.begin(),stu.end(),cmp); 31 int t=0,row=k; 32 while(row){ 33 if(row==k){ 34 m=n/k+n%k; 35 } 36 else m=n/k; 37 vector<string> ans(m); 38 ans[m/2]=stu[t].name; 39 j=m/2-1; 40 for(i=t+1;i<t+m;i=i+2){ 41 ans[j--]=stu[i].name; 42 } 43 j=m/2+1; 44 for(i=t+2;i<t+m;i=i+2){ 45 ans[j++]=stu[i].name; 46 } 47 cout<<ans[0]; 48 for(i=1;i<m;i++){ 49 cout<<" "<<ans[i]; 50 } 51 cout<<endl; 52 t=t+m; 53 row--; 54 } 55 return 0; 56 }
标签：思路 tput div code where pen cst ide stream
原文地址：https://www.cnblogs.com/Mered1th/p/10441176.html
