KKT 数组合并：算法题解 - C++ 实现

#include #include using namespace std;

int main() { int n, m; cin >> n >> m;

vector<int> t(n);
vector<int> d(m);

for (int i = 0; i < n; i++) {
    cin >> t[i];
}

for (int i = 0; i < m; i++) {
    cin >> d[i];
}

vector<int> result;

int i = 0, j = 0;
while (i < n && j < m) {
    if (t[i] <= d[j]) {
        result.push_back(t[i]);
        i++;
    } else {
        result.push_back(d[j]);
        j++;
    }
}

while (i < n) {
    result.push_back(t[i]);
    i++;
}

while (j < m) {
    result.push_back(d[j]);
    j++;
}

for (int k = 0; k < result.size(); k++) {
    cout << result[k] << " ";
}

return 0;

}