Найти минимум в первом массиве, предварительно исключив элементы, совпадающие с элементами второго массива

#include <iostream>
#include <vector>
#include <algorithm>
 
int main()
{
    typedef int Item;
 
    const Item AMOUNT = 100000;
 
    std::vector<Item> army(AMOUNT);
 
    for (size_t i = 0; i < AMOUNT; ++i)
        army[i] = i;
 
    std::vector<Item> victim;
    std::cout << "Enter numbers of Lee Siy Syn's victims "
                 "(to quit enter any negative number):\n";
 
    Item number;
    std::cin >> number;
    while (number >= 0)
    {
        victim.push_back(number);
        std::cin >> number;
    }
 
    std::vector<Item> survivor;
 
    std::vector<Item>::iterator p = victim.begin();
    for (size_t i = 0; i < AMOUNT; ++i)
    {
        p = std::find (victim.begin(), victim.end(), i);
        if (p == victim.end())
            survivor.push_back(i);
    }
 
    std::cout << "\nThe most talented warrior is: "
              << *std::max_element(survivor.begin(), survivor.end())
              << "\n";
 
    return 0;
}

#include <iostream>
#include <vector>
#include <algorithm>
 
typedef int Item;
 
bool not_found_in_victims_list(Item warrior, const std::vector<Item> & victims)
{
    return victims.end() == std::find(victims.begin(), victims.end(), warrior);
}
 
int main()
{
    const Item AMOUNT = 100000;
 
    std::vector<Item> army(AMOUNT);
 
    for (size_t warrior_number = 0; warrior_number < AMOUNT; ++warrior_number)
        army[warrior_number] = warrior_number;
 
    std::vector<Item> victims;
    std::cout << "Enter numbers of Lee Siy Syn's victims "
                 "(to quit enter any negative number):\n";
 
    Item number_of_executed_warrior;
    std::cin >> number_of_executed_warrior;
    while (number_of_executed_warrior >= 0)
    {
        victims.push_back(number_of_executed_warrior);
        std::cin >> number_of_executed_warrior;
    }
 
    std::vector<Item> survivors;
    for (size_t warrior_number = 0; warrior_number < AMOUNT; ++warrior_number)
    {
        if (not_found_in_victims_list(warrior_number, victims))
            survivors.push_back(warrior_number);
    }
 
    std::cout << "\nThe most talent warrior is: "
              << *std::min_element(survivors.begin(), survivors.end())
              << "\n";
 
    return 0;
}