PAT 1109 Group Photo 集体照

这题可以用双向队列，很容易就解决！

具体看代码

#include <iostream>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <string>
#include <queue>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <cctype>
#include <set>
#include <deque>



using namespace std;



const int MAXN = 10010;


struct man{
    string name;
    int tall;
}men[MAXN];

bool cmp(man a,man b){
    if (a.tall != b.tall) {
        return a.tall > b.tall;
    }
    return a.name < b.name;
}

vector<string> v[1010];

int main(){
    deque<int> q;
//    printf("123\n");
    int n,k;
    scanf("%d%d",&n,&k);
    int people = n / k;
    int last = n % k + people;
    for (int i=0; i<n; i++) {
        cin >> men[i].name;
        scanf("%d",&men[i].tall);
    }
    sort(men, men+n, cmp);
    q.push_back(0);
    for (int i=1; i<last; i++) {
        if(i&1) q.push_front(i);
        else q.push_back(i);
    }
    int space = 0;
    for (auto it = q.begin(); it != q.end(); it++) {
        space++;
        cout << men[*it].name;
        if (space != last) printf(" ");
        else printf("\n");
    }
    
    q.clear();
    space = 0;
    int count = 0;
    for (int i=last; i<n; i++) {
        count++;
        if(count & 1) q.push_back(i);
        else q.push_front(i);
        if (count == people) {
            for (auto it = q.begin(); it != q.end(); it++) {
                space++;
                cout << men[*it].name;
                if (space != count) printf(" ");
                else printf("\n");
            }
            q.clear();
            space = 0;
            count = 0;
        }
    }

    
}