SCTDL058.cpp

/**
 * @file SCTDL058.cpp
 * @author long (you@domain.com)
 * @brief Find the k-th element after merging 2 arrays with ascending order.
 * @version 0.1
 * @date 2023-06-10
 * 
 * @copyright Copyright (c) 2023
 * 
 */
#include <bits/stdc++.h>
#define endl "\n"
using namespace std;
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t;
    cin >> t;
    while (t--)
    {
        int n, m, k;
        cin >> n >> m >> k;
        int a[n], b[m], p1 = 0, p2 = 0, ans;
        for (int i = 0; i < n; i++)
            cin >> a[i];
        for (int i = 0; i < m; i++)
            cin >> b[i];
        while (k--)
        {
            if (p1 == n - 1)
                ans = b[p2++];
            if (p2 == m - 1)
                ans = a[p1++];
            if (a[p1] < b[p2])
            {
                ans = a[p1];
                p1++;
            }
            else
            {
                ans = b[p2];
                p2++;
            }
        }
        cout << ans << endl;
    }
}