| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 10235 | A班-许锘林 | 集合运算 | C++ | Accepted | 100 | 2 MS | 268 KB | 1149 | 2025-05-04 17:11:47 |
#include <bits/stdc++.h> using namespace std; int n,m,a[1010],b[1010]; int main() { cin>>n; for(int i = 0;i < n;i++) { cin>>a[i]; } cin>>m; for(int i = 0;i < m;i++) { cin>>b[i]; } sort(a,a + n); sort(b,b + m); int ii = 0,jj = 0; while(ii < n && jj < m) { if(a[ii] == b[jj]) { cout<<a[ii]<<" "; ii++; jj++; } else if(a[ii] < b[jj]) { ii++; } else if(a[ii] > b[jj]) { jj++; } } cout<<endl; ii = 0; jj = 0; while(ii < n && jj < m) { if(a[ii] == b[jj]) { cout<<a[ii]<<" "; ii++; jj++; } else if(a[ii] < b[jj]) { cout<<a[ii]<<" "; ii++; } else if(a[ii] > b[jj]) { cout<<b[jj]<<" "; jj++; } } while(ii < n) { cout<<a[ii]<<" "; ii++; } while(jj < m) { cout<<b[jj]<<" "; jj++; } cout<<endl; ii = 0; jj = 0; while(ii < n && jj < m) { if(a[ii] == b[jj]) { ii++; jj++; } else if(a[ii] < b[jj]) { cout<<a[ii]<<" "; ii++; } else if(a[ii] > b[jj]) { jj++; } } while(ii < n) { cout<<a[ii]<<" "; ii++; } return 0; }