【PAT】1109. Group Photo

考查点：排序，模拟题

思路和提交情况：先排序，然后用二维数组记录下标，主要是细节问题，首先要理解排序的规则，然后填数的时候要把首行和其他行分开处理

#define LOCAL
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#define FOR(i, x, y) for(int i = x; i <= y; i++)
#define rFOR(i, x, y) for(int i = x; i >= y; i--)
#define MAXN 10010
#define oo 0x3f3f3f3f
using namespace std;

struct person
{
    char name[25];
    int height;
}stu[MAXN];
int ans[MAXN][MAXN];
bool cmp(person a,person b)
{
    if(a.height!=b.height)return a.height>b.height;
    else return strcmp(a.name,b.name)<0;
}
int main()
{
     #ifdef LOCAL
        freopen("data.in","r",stdin);
        freopen("data.out","w",stdout);
    #endif // LOCAL

    double n,row;
    scanf("%lf%lf",&n,&row);
    int m=(int)(n/row+0.5);
    FOR(i,0,n-1)
    {
        scanf("%s%d",stu[i].name,&stu[i].height);
    }
    int num=(int)n;
    sort(stu,stu+num,cmp);
    int j=0;
    FOR(i,0,row-1)
    {
        if(i==0)
        {
            int k=n-(row-1)*m;
            int mid=k/2+1;j=1;
            ans[0][mid]=0;
            int bg=mid-1,ed=mid+1;
            while(j<k){
                if(j<k){
                    ans[0][bg--]=j++;
                }
                if(j<k){
                    ans[0][ed++]=j++;
                }

            }
        }
        else{
            int mid=m/2+1;
            int bg=mid-1,ed=mid+1;
            int cnt=1; ans[i][mid]=j;
            while(cnt<m)
            {
                if(cnt<m){
                    ans[i][bg--]=j+cnt;cnt++;
                }
                if(cnt<m){
                    ans[i][ed++]=j+cnt;cnt++;
                }
            }
            j+=m;
        }
    }
    int k=n-(row-1)*m;
    FOR(i,1,k)
    {
        int id=ans[0][i];
        printf("%s",stu[id].name);
        if(i!=k)printf(" ");
        else printf("\n");
    }
    FOR(i,1,row-1)
    FOR(j,1,m)
    {
        int id=ans[i][j];
        printf("%s",stu[id].name);
        if(j!=m)printf(" ");
        else printf("\n");
    }
    return 0;
}