Find sorted set members missing from another set.

#include <iostream>
#include <string>
#include <string_view>
#include <vector>
#include <array>
#include <algorithm>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <tuple>
#include <bitset>
#include <memory>
#include <optional>
#include <variant>
#include <functional>
#include <charconv>
#include <regex>
#include <fstream>
#include <sstream>
#include <filesystem>
#include <iomanip>
#include <cmath>
#include <cctype>
#include <limits>
#include <chrono>
#include <thread>
#include <future>
#include <mutex>
#include <atomic>
#include <condition_variable>

int main() {
    std::cout << std::boolalpha;
    std::vector<int> a{1,2,3},b{2,3},result;
    std::set_difference(a.begin(),a.end(),b.begin(),b.end(),std::back_inserter(result));
    for (int n:result) std::cout << n << "\n";
}