Răspuns :
Răspuns:
void Insert(std::vector<int>& vector, int number)
{
vector.push_back(number);
if (vector.size() > 1)
{
AscendingSort(vector);
}
}
void AscendingSort(std::vector<int>& vector)
{
std::sort(vector.begin(), vector.end(), [](int a, int b) {return a < b; });
}
void RemoveByPosition(std::vector<int>& vector, int position)
{
vector.erase(vector.begin() + position);
}
void RemoveByValue(std::vector<int>& vector, int value)
{
auto it = std::find(vector.begin(), vector.end(), value);
if (it != vector.end())
{
vector.erase(it);
}
else
{
std::cout << "Elementul nu se afla in vector." << std::endl;
}
}
void main()
{
std::vector<int> vector;
int number;
std::cin >> number;
Insert(vector, number);
std::cin >> number;
Insert(vector, number);
std::cin >> number;
Insert(vector, number);
std::cin >> number;
Insert(vector, number);
RemoveByPosition(vector, 0);
RemoveByValue(vector, number);
}
Explicație:
