Huawei test-shaped array merging

Merges two shaped arrays of input and removes repeated numbers in ascending order;

Case INPUT: 3

1 2 5

4

-1 0 3 2

Case output:-101

#include <iostream> #include <vector>using namespace std;void maopao (vector<int>&arry); int main () {int n1,n2,num;string line;vector<int>arry1;cin>>n1;for (int i=0;i!=n1;++i) {cin>>num; Arry1.push_back (num);} cin>>n2;for (int j=0;j!=n2;++j) {cin>>num;arry1.push_back (num);} Maopao (Arry1); for (Vector<int>::iterator Iter=arry1.begin () +1;iter!=arry1.end (); ++iter) {if (* (iter-1) ==* ( ITER) {arry1.erase (ITER); Iter=arry1.begin () +1;}} For (Vector<int>::iterator Iter2=arry1.begin (); Iter2!=arry1.end (); ++iter2) {cout<<*iter2;} Cout<<endl;return 0;} void Maopao (vector<int>&arry) {int Temp;int k;vector<int>::iterator Iter;vector<int>::iterato    R Iter1; For (Iter=arry.begin (), K=0;iter!=arry.end (); ++iter,++k) {for (Iter1=arry.begin () +1;iter1!=arry.end ()-k;++iter                  1) {if (* (iter1-1) >*iter1) {temp=* (iter1-1);           * (iter1-1) =*iter1;       *iter1=temp;   }          }      }    }

235

Huawei test-shaped array merging