[PAT-A] 1109 Group Photo

Java

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Comparator;

public class Main {
    static final int N = 10010;
    static int n, m;
    static Person[] p = new Person[N];

    static class Person {
        String name;
        int h;

        Person(String name, int h) {
            this.name = name;
            this.h = h;
        }
    }

    static class PersonComparator implements Comparator<Person> {
        @Override
        public int compare(Person a, Person b) {
            if (a.h != b.h) return b.h - a.h;
            else return a.name.compareTo(b.name);
        }
    }

    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String[] input = br.readLine().split(" ");
        n = Integer.parseInt(input[0]);
        m = Integer.parseInt(input[1]);

        for (int i = 0; i < n; i++) {
            String[] personInfo = br.readLine().split(" ");
            p[i] = new Person(personInfo[0], Integer.parseInt(personInfo[1]));
        }

        Arrays.sort(p, 0, n, new PersonComparator());

        int cnt = 0;
        for (int i = 0; i < m; i++) {
            int len = n / m;
            if (i == 0) {
                len += n % m;
            }

            StringBuilder res = new StringBuilder();
            for (int j = 0; j < len; j++) {
                if (j % 2 == 0) res.append(p[cnt++].name).append(" ");
                else res.insert(0, p[cnt++].name + " ");
            }

            while (res.length() > 0 && res.charAt(res.length() - 1) == ' ') {
                res.deleteCharAt(res.length() - 1);
            }
            System.out.println(res);
        }
    }
}

C++

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 10010;

int n, m;

struct Person {
    string name;
    int h;

    bool operator<(const Person &t) const {
        if (h != t.h) return h > t.h;
        else return name < t.name;
    }
} p[N];

int main() {
    cin >> n >> m;
    for (int i = 0; i < n; ++i) cin >> p[i].name >> p[i].h;

    sort(p, p + n);

    int cnt = 0;
    for (int i = 0; i < m; ++i) {
        int len = n / m;
        if (i == 0) len += n % m;    // 多余人放到最后一行

        string res;
        for (int j = 0; j < len; ++j) {
            if (j % 2 == 0) res = res + p[cnt++].name + " ";
            else res = p[cnt++].name + " " + res;
        }

        while (*res.rbegin() == ' ') res.pop_back();
        cout << res << endl;
    }

    return 0;
}