Найти слово которое имеет наименьшую длину

#include "stdafx.h"
#include "string"
#include "vector"
#include <iostream>
#include <algorithm>
 
 
int main()
{
    std::vector<std::string> words = {"glass", "instantiation", "processRange", "console", "d"};
    std::string min = *std::min_element(words.begin(), words.end());
    std::cout << "Min word: " << min << "\n";
    
    return 0;
}

std::min_element(words.begin(), words.end(), [](const auto &lhs, const auto &rhs) { return lhs.length() < rhs.length(); })

#include "stdafx.h"
#include "string"
#include "vector"
#include <iostream>
#include <algorithm>
 
std::size_t length(const std::string& left, const std::string& right)
{
    return left.length() < right.length();
}
int main()
{
    std::vector<std::string> words = { "glass", "instantiation", "processRange", "console", "d" };
    std::string min = *std::min_element(words.begin(), words.end(), &length);
 
    std::cout << "Min word: " << min << "\n";
    return 0;
}

#include "string"
#include "vector"
#include <iostream>
#include <algorithm>
 
struct compare {
    bool operator()(const std::string& first, const std::string& second) {
        return first.size() < second.size();
    }
};
int main()
{
    std::vector<std::string> words = { "glass", "instantiation", "processRange", "console", "d" };
    compare c;
    std::sort(words.begin(), words.end(),c);
    std::cout << "Min word: " << words[0] << "\n";
 
    return 0;
}

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
 
int main()
{
    const std::vector<std::string> words {"at", "ab", "abc", "abcd", "c", "a"};
 
    std::cout << "The first min word: " << *std::min_element(cbegin(words), cend(words), 
        [](const auto &s1, const auto &s2){ return s1.length() < s2.length(); }) << std::endl;
}