그냥 간단하게 하면 되는 것을 꼼수를 써보겠다고 쇼를 했다.
자세한건 다음에...
#include <iostream>#include <vector>#include <algorithm>
#define v std::vector<int>
v MergeArrays(v A, v B) { v u(100),n(100),x(100); n.resize(set_intersection(A.begin(), A.end(), B.begin(), B.end(), n.begin())-n.begin()); x.resize(set_symmetric_difference(A.begin(), A.end(), B.begin(), B.end(), x.begin())-x.begin()); u.resize(set_symmetric_difference(n.begin(), n.end(), x.begin(), x.end(), u.begin())-u.begin()); u.resize(unique(u.begin(), u.end())-u.begin()); return u;}
int main() { v r = MergeArrays({10,10,10,15,20,20,25,25,30,7000},{10,15,20,20,27,7200}); for(int i:r) std::cout << i << ", ";
return 0;}
