C++ 算法题:题库插入 - 将新题目按难度插入排序
#include
using namespace std;
int main() { int n, m; cin >> n >> m;
vector<int> t(n);
for (int i = 0; i < n; i++) {
cin >> t[i];
}
vector<int> d(m);
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 i = 0; i < result.size(); i++) {
cout << result[i] << " ";
}
cout << endl;
return 0;
}
原文地址: https://www.cveoy.top/t/topic/qmlQ 著作权归作者所有。请勿转载和采集!