Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- using namespace std;
- ifstream fin("interclasare.in");
- ofstream fout("interclasare.out");
- int a[100], b[100], c[205];
- int main() {
- int n, m;
- fin >> n;
- for (int i = 1; i <= n; i++)
- fin >> a[i];
- fin >> m;
- for (int j = 1; j <= m; j++)
- cin >> b[j];
- int i = 1, j = 1, k = 1;
- while (i <= n && j <= m) {
- if (a[i] < b[j]) { /// avansam in vectoru a
- c[k] = a[i];
- i++;
- k++;
- } else if (a[i] > b[j]) { /// avansam in vectoru b
- c[k] = b[j];
- j++;
- k++;
- } else { /// ambele elemente sunt egale si le trecem pe ambele in vectorul 2 si avansam si in a si in b
- c[k] = a[i];
- k++;
- c[k] = b[j];
- k++;
- i++;
- j++;
- }
- }
- if (i <= n) {
- while (i <= n) {
- c[k] = a[i];
- i++;
- k++;
- }
- }
- if (j <= m) {
- while (j <= m) {
- c[k] = b[j];
- j++;
- k++;
- }
- }
- for (int i = 1; i <= k - 1; i++) {/// k va creste cu 1 deoarece la final avem k++ si mereu va fi cu 1 in fata de aia ne oprim la
- fout << c[i] << " ";
- if(i%10==0)
- fout<<endl;
- }
- return 0;
- }
RAW Paste Data