zoukankan      html  css  js  c++  java
  • PAT A1109 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 (104​​), 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
    
     
     1 #include <stdio.h>
     2 #include <algorithm>
     3 #include <set>
     4 #include <string.h>
     5 #include <vector>
     6 #include <math.h>
     7 #include <queue>
     8 #include <iostream>
     9 #include <string>
    10 using namespace std;
    11 const int maxn = 10011;
    12 int n,k;
    13 string res[11][maxn];
    14 struct node{
    15     string id;
    16     int h;
    17 };
    18 bool cmp(node n1,node n2){
    19     return n1.h==n2.h?n1.id<n2.id:n1.h>n2.h;
    20 }
    21 vector<node> v;
    22 int main(){
    23     scanf("%d %d",&n,&k);
    24     for(int i=1;i<=n;i++){
    25         node tmp;
    26         cin>>tmp.id>>tmp.h;
    27         v.push_back(tmp);
    28     }
    29     sort(v.begin(),v.end(),cmp);
    30     int num = n/k;
    31     int left = n - (k-1)*num;
    32     int pos=left/2+1;
    33     int offset=0,flag=1;
    34     for(int i=0;i<left;i++){
    35         res[0][pos]=v[i].id;
    36         offset++;
    37         flag*=-1;
    38         pos = pos+offset*flag;
    39     }
    40     int index=left;
    41     for(int i=1;i<k;i++){
    42         pos=num/2+1;
    43         offset=0,flag=1;
    44         for(int j=0;j<num;j++){
    45             res[i][pos]=v[index++].id;
    46             offset++;
    47             flag*=-1;
    48             pos = pos+offset*flag;
    49         }
    50     }
    51     for(int i=1;i<=left;i++){
    52         printf("%s%s",res[0][i].c_str(),i==left?"
    ":" ");
    53     }
    54     for(int i=1;i<k;i++){
    55         for(int j=1;j<=num;j++){
    56             printf("%s%s",res[i][j].c_str(),j==num?"
    ":" ");
    57         }
    58     }
    59 }
    View Code

    注意点:按题目实现排序后一个个插进去就好了,半小时多点ac,还行吧

    ---------------- 坚持每天学习一点点
  • 相关阅读:
    BAT 大厂最流行的测试技术体系与测试职业发展晋级指南
    通知 | 2021 第一期《测试开发实战宝典》赠书活动顺利结束!
    你还缺个好工作?但7月毕业季即将来临怎么办
    一图看懂云栖大会「云原生」重磅发布
    阿里云重磅发布业务中台产品 BizWorks,中台发展进入下一个阶段
    云栖·追踪云原生|Serverless入围阿里云十大核心技术
    先行一步,7大技术创新和突破,阿里云把 Serverless 领域的这些难题都给解了
    New homework
    German
    suggestion
  • 原文地址:https://www.cnblogs.com/tccbj/p/10453081.html
Copyright © 2011-2022 走看看