洗牌 有道2017测试开发工程师编程题

#include <iostream>
#include <vector>
#include <algorithm>
#include <deque>
using namespace std;

void play(vector<int>& card)
{
    const size_t N = card.size();
    vector<int> cardO = card;
    int idx = 0;
    for (int i = 0; i < N / 2; i++)
    {
        card[idx++] = cardO[i];
        card[idx++] = cardO[i + N / 2];
    }
}

int main()
{
    int nTest;
    cin >> nTest;
    while (nTest--)
    {
        int n, k;
        cin >> n >> k;
        vector<int> card(2 * n);
        for (int i = 0; i < 2 * n; i++)
            cin >> card[i];
        for (int i = 0; i < k; i++)
            play(card);
        for (int i = 0; i < card.size() - 1; i++)
            cout << card[i] << " ";
        cout << card[2 * n - 1];
        cout << endl;
    }
}