void vectorPrint(vector<int>);
void setVec(vector<int>);
vector<int> fillVecs(vector<int>);
bool myfunction(int, int);
vector<int> unionVecs(vector<int>);
void intersectionality(vector<int>);
int main()
{
	vector<int> d;
	vector<int> c;
	setVec(c);
	//fillVecs(c);
	setVec(d);
	vectorPrint(d);
	fillVecs(numVec);
	unionVecs(numVec);



	system("pause");
	return 0;
}
void setVec(vector<int> setV) {
	for (int i = 0; i != -1; i++) {
		int y;
		std::cin >> y;
		if (y > 100 || y < 0 && y != -1) {

			std::cout << "number not in range 1-100" << endl;
		}
		else if (y <= 100 && y >= 0) {
			numVec.push_back(y);
		}
		else if (y = -1) {
			break;
		}
		std::sort(numVec.begin(), numVec.end());

	}

}
vector<int> fillVecs(const vector<int>)
{
	return numVec;
}
void vectorPrint(vector<int> setV) {
	for (vector<int>::iterator i = setV.begin(); i != setV.end(); ++i) {
		std::cout << *i << ' ';
	}
	std::cout << "yo";
}
bool myfunction(int i, int j) {
	return (i == j);
}
vector<int> unionVecs(vector<int> m_union) {

	it = std::unique(numVec.begin(), numVec.end());
	numVec.resize(std::distance(numVec.begin(), it));
	std::unique(numVec.begin(), numVec.end(), myfunction);
	std::cout << "myvector contains:";
	for (it = numVec.begin(); it != numVec.end(); ++it)
		std::cout << ' ' << *it;
	std::cout << '\n';
	return m_union;
}/*
void intersectionality(vector<int>) {
	set_intersection(d.begin(), d.end(), c.begin(), c.end(), inserter(m_inter, m_inter.begin()));
	cout << "intersection" << endl;
	for (vector<int>::iterator it = m_inter.begin(); it != m_inter.end(); it++) {
		cout << *it << " ";
	}
}