思路很对的样子，10发罚时！！！！求大佬hack qwq

#include <bits/stdc++.h>
using namespace std;
const int N = 5e4 + 10;
int n, k, cnt;
int a[N], b[N];
int ans[N];

void work()
{
    cnt = 0;
    cin >> n >> k;
    a[n + 1] = 0;
    for (int i = 1; i <= n; i++) cin >> a[i];
    for (int i = 1; i <= n; i++) cin >> b[i];
    sort(a + 1, a + n + 1);
    sort(b + 1, b + n + 1);
    for (int i = 1; i <= n; i++)
    {
        if (a[i] == a[i - 1])
        {
            cout << a[i] << " " << a[i] << " ";
            cnt++;
        }
        if (k == cnt) break;
    }
    cnt = 0;
    for (int i = 1; i <= n; i++)
    {
        
        if (b[i] == b[i - 1])
        {
            ans[++cnt] = b[i];
            ans[++cnt] = b[i];
            k--;
        }
        if (k == 0) break;
    }
    if (k == 0)
    {
        cout << "\n";
        for (int i = 1; i <= cnt; i++) cout << ans[i] << " ";
        cout << "\n"; return;
    }
    else
    {
        k *= 2;
        for (int i = 1; i <= n; i++)
        {
            if (a[i] != a[i - 1] && a[i] != a[i + 1])
            {
                cout << a[i] << " ";
                ans[++cnt] = a[i];
            } 
            if (cnt == k) break;
        }
    }
    cout << "\n";
    for (int i = 1; i <= cnt; i++) cout << ans[i] << " ";
    cout << "\n"; 
}

int main()
{
    std::ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int T; cin >> T;
    while (T--) work();
    return 0;
}