1042 Shuffling Machine

//
// Created by CyIce on 2021/2/25.
//

#include <stdio.h>
#include <algorithm>

using namespace std;

struct poker {
    char type;
    int num;
    int order;
} pokers[54]p;

int order[54];

void printPoker(poker p) {
    printf("%c%d", p.type, p.num);
}

bool cmp(poker a, poker b) {
    return a.order < b.order;
}

int main() {

    int k;
    scanf("%d", &k);
    for (int i = 0; i < 54; ++i) {
        scanf("%d", &order[i]);
    }

    for (int i = 1; i <= 13; ++i) {
        pokers[i - 1] = poker{'S', i, 0};
        pokers[i + 12] = poker{'H', i, 0};
        pokers[i + 25] = poker{'C', i, 0};
        pokers[i + 38] = poker{'D', i, 0};
    }
    pokers[52] = poker{'J', 1, 0};
    pokers[53] = poker{'J', 2, 0};


    for (int i = 0; i < k; ++i) {
        for (int j = 0; j < 54; ++j) {
            pokers[j].order = order[j];
        }
        sort(pokers, pokers + 54, cmp);
    }
    for (int i = 0; i < 54; ++i) {
        printPoker(pokers[i]);
        if (i != 53) printf(" ");
        else printf("\n");
    }
    return 0;
}