#include <iostream>
#include<vector>
#include <algorithm>
#include <iterator>
int main()
{
std::vector<int> v1;
std::vector<int> v2;
std::vector<int> c;
for(int i = 0; i<6; i++)
v1.push_back(i);
v2.push_back(2);
v2.push_back(3);
v2.push_back(3);
v2.push_back(4);
v2.push_back(5);
v2.push_back(5);
v2.push_back(5);
std::sort(std::begin(v1), std::end(v1));
std::sort(std::begin(v2), std::end(v2)); //对容器内的值进行排序
v2.erase(std::unique(v2.begin(), v2.end() ), v2.end()); //删除重复的值
std::set_symmetric_difference(std::begin(v1), std::end(v1),
std::begin(v2), std::end(v2),
std::back_inserter(c));
for(int i = 0; i<c.size(); i++)
std::cout<<c[i]<<std::endl;
return 0;
}