#include <bits/stdc++.h> using namespace std; using ll = long long; int main() { ll n,m,a[10010],b[10010],c[20010]; cin>>n>>m; for(ll i=1;i<=n;i++){ cin>>a[i]; } for(ll i=1;i<=m;i++){ cin>>b[i]; } for(ll i=1;i<=n;i++){ c[i]=a[i]; } for(ll i=1;i<=m;i++){ c[n+i]=b[i]; } sort(c+1,c+n+m+1); for(ll i=1;i<=n+m;i++){ cout<<c[i]<<" "; } return 0; } 海量解题

#include<iostream> #include<algorithm> using namespace std; int main(){ int n,m,a[20005]; //一口气输入完 cin>>n>>m; for(int i=1;i<=n;i++){ cin>>a[i]; } for(int i=n+1;i<=n+m;i++){ //放入a[]，准备排序 cin>>a[i]; } sort(a+1,a+n+m+1); //algorithm for(int i=1;i<=n+m;i++){ cout<<a[i]<<" "; } }

#include<bits/stdc++.h> using namespace std; int a[10005]; int main() { int n,m,x; cin>>n>>m; for (int i=1;i<=n+m;i++) { cin>>x; a[i]=x; } sort(a+1,a+n+m+1); for (int i=1;i<=n+m;i++) { cout<<a[i]<<" "; } return 0; }

合并有序数组 #include<bits/stdc++.h> using namespace std; const int s=10010; int n,m; int a[s]; int main(){ cin>>n>>m; for(int i=1;i<=n;i++){ cin>>a[i]; } for(int i=n+1;i<=n+m;i++){ cin>>a[i]; } sort(a+1,a+1+n+m); for(int i=1;i<=n+m;i++){ cout<<a[i]<<" "; } }

#include<bits/stdc++.h> using namespace std; int main(){ int a[100000],n,m; cin>>n>>m; for(int i=1;i<=n;i++)cin>>a[i]; for(int i=n+1;i<=n+m;i++)cin>>a[i]; sort(a+1,a+n+m+1); for(int i=1;i<=n+m;i++){ cout<<a[i]<<" "; } return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; vector<int> arr1(n), arr2(m); for (int i = 0; i < n; i++){ cin >> arr1[i]; }for (int i = 0; i < m; i++){ cin >> arr2[i]; } vector<int> merged; int i = 0, j = 0; while (i < n && j < m) { if (arr1[i] < arr2[j]) { merged.push_back(arr1[i]); i++; } else { merged.push_back(arr2[j]); j++; } }while (i < n) { merged.push_back(arr1[i]); ++i; }while (j < m) { merged.push_back(arr2[j]); ++j; }for (int k = 0; k < merged.size(); ++k) { cout << merged[k]; if (k != merged.size() - 1) { cout << " "; } } cout << endl; return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; vector<int> arr1(n), arr2(m); for (int i = 0; i < n; i++){ cin >> arr1[i]; }for (int i = 0; i < m; i++){ cin >> arr2[i]; } vector<int> merged; int i = 0, j = 0; while (i < n && j < m) { if (arr1[i] < arr2[j]) { merged.push_back(arr1[i]); i++; } else { merged.push_back(arr2[j]); j++; } }while (i < n) { merged.push_back(arr1[i]); ++i; }while (j < m) { merged.push_back(arr2[j]); ++j; }for (int k = 0; k < merged.size(); ++k) { cout << merged[k]; if (k != merged.size() - 1) { cout << " "; } } cout << endl; return 0; }