#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
vector<int> vec{ 1, 1, 2, 3, 4, 4, 4, 5, 6, 6, 7, 7, 7, 7 };
std::sort(vec.begin(), vec.end());
for (int i = 0; i < vec.size() - 1; i++) {
if (vec[i] == vec[i + 1]) {
vec.erase(vec.begin() + i);
i--;
}
}
for (int i = 0; i < vec.size(); i++)
cout << vec[i] << endl;
return 0;
}
/*
run:
1
2
3
4
5
6
7
*/