快速搜索C++中排序的字符串列表

#include<iostream>
#include <set>
#include<string>

int main() {
    std::set<std::string> strings = {"apple", "banana", "cherry", "date", "fig"};

    std::string target = "cherry";
    auto it = strings.lower_bound(target);
    if (it != strings.end() && *it == target) {
        std::cout << "Found "<< target<< std::endl;
    } else {
        std::cout << "Not found"<< std::endl;
    }

    return 0;
}

#include<iostream>
#include <map>
#include<string>

int main() {
    std::map<int, std::string> strings = {{1, "apple"}, {2, "banana"}, {3, "cherry"}, {4, "date"}, {5, "fig"}};

    int target_key = 3;
    auto it = strings.lower_bound(target_key);
    if (it != strings.end() && it->first == target_key) {
        std::cout << "Found " << it->second<< std::endl;
    } else {
        std::cout << "Not found"<< std::endl;
    }

    return 0;
}