C++ 程序设计题库插入题:算法实现与示例
#include
using namespace std;
int main() { int n, m; cin >> n >> m;
vector<int> ti(n);
for (int i = 0; i < n; i++) {
cin >> ti[i];
}
vector<int> dj(m);
for (int i = 0; i < m; i++) {
cin >> dj[i];
}
vector<int> result;
int i = 0, j = 0;
while (i < n && j < m) {
if (ti[i] <= dj[j]) {
result.push_back(ti[i]);
i++;
} else {
result.push_back(dj[j]);
j++;
}
}
while (i < n) {
result.push_back(ti[i]);
i++;
}
while (j < m) {
result.push_back(dj[j]);
j++;
}
for (int k = 0; k < result.size(); k++) {
cout << result[k] << " ";
}
return 0;
}
原文地址: https://www.cveoy.top/t/topic/qmlG 著作权归作者所有。请勿转载和采集!