这题很明显考的归并排序，我们绝对不能用归并，得像我一样用sort才能AC！

#include<bits/stdc++.h> using namespace std; int main(){ int n,m,a[10005],b[10005],i=0,j=0; cin >> n >> m; for(int f=0;f<n;f++){ cin >> a[f]; } for(int f=0;f<m;f++){ cin >> b[f]; } while(i<n&&j<m){ if(a[i]<b[j]){ cout << a[i++] << " "; } else{ cout << b[j++] << " "; } } while(i<n){ cout << a[i++] << " "; } while(j<m){ cout << b[j++] << " "; } }

#include <iostream> #include <vector> int main() { int n, m; std::cin >> n >> m; } 或 #include<bits/stdc++.h> using namespace std; int main(){ int a[10005],b[10005],c[10005]; int n,m; cin>>n>>m; for(int i=0;i<n;i++) cin>>a[i]; for(int i=0;i<m;i++) cin>>b[i]; int i=0,j=0,k=0; while(i<n and j<m){ if(a[i]>b[j]){ c[k++]=b[j++]; }else{ c[k++]=a[i++]; } } while(i<n){ c[k++]=a[i++]; } while(j<m){ c[k++]=b[j++]; } for(int ii=0;ii<k;ii++){ cout<<c[ii]<<" "; } return 0; }

谁用归并排序做谁是怨种 极简10行 sort代码：

#include <iostream> using namespace std; int a[10005],b[10005]; void paixv(int a[],int b[],int n,int m){ int tmp[20005]; int i = 1,j = 1; while (i <= n && j <= m){ if (a[i] <= b[j]){ cout << a[i] << " "; i++; }else{ cout << b[j] << " "; j++; } } while (i <= n){ cout << a[i] << " "; i++; } while (j <= m){ cout << b[j] << " "; j++; } return; } int main(){ int n,m; cin >> n >> m; for (int i = 1; i <= n;i++){ cin >> a[i]; } for (int i = 1; i <= m;i++){ cin >> b[i]; } paixv(a,b,n,m); return 0; }

result=[] i,j=0,0 n, m = map(int, input().split()) array1 = list(map(int, input().split())) array2 = list(map(int, input().split())) while i < n and j < m: if array1[i] < array2[j]: result.append(array1[i]) i += 1 else: result.append(array2[j]) j += 1 添加剩余的元素 while i < n: result.append(array1[i]) i += 1 while j < m: result.append(array2[j]) j += 1 print(" ".join(map(str, result)))

#include<bits/stdc++.h> using namespace std; long long a[83456],b,c,d[82345],h[187777]; int main(){ cin >> b>>c; for(int i = 1;i<=b;i++){ cin >> a[i]; } for(int i = 1;i<=c;i++){ cin >> d[i]; } long long k = 0; long long i = 1,j = 1; while(i <=b && j <= c){ if(a[i] > d[j]) h[k] = d[j]; else h[k] = a[i]; } while(i<=b) h[k] = a[i]; while(j<=c) h[k] = d[j]; for(int i = 1;i<=k;i++){ cout<<h[i]<<" "; } return 0; }

#include <iostream> using namespace std; int a[10005],b[10005]; void paixv(int a[],int b[],int n,int m){ int tmp[20005]; int i = 1,j = 1; while (i <= n && j <= m){ if (a[i] <= b[j]){ cout << a[i] << " "; i++; }else{ cout << b[j] << " "; j++; } } while (i <= n){ cout << a[i] << " "; i++; } while (j <= m){ cout << b[j] << " "; j++; } return; } int main(){ int n,m; cin >> n >> m; for (int i = 1; i <= n;i++){ cin >> a[i]; } for (int i = 1; i <= m;i++){ cin >> b[i]; } paixv(a,b,n,m); return 0; }

经典的归并

#include <bits/stdc++.h> using namespace std; int n,m,x; vector<int> v; void work() { scanf("%d%d",&n,&m); for(int i=1;i<=n;i++) { scanf("%d",&x); v.push_back(x); } for(int i=1;i<=m;i++) { scanf("%d",&x); v.push_back(x); } sort(v.begin(),v.end()); for(int i=0;i<v.size();i++) printf("%d ",v[i]); } int main() { work(); return 0; }