Строки (Найти длину самого короткого и самого длинного слова, а также сами эти слова)

#include <boost/regex.hpp>

#include <string>
#include <iostream>
#include <boost/regex.hpp>
 
int main() {
    std::setlocale(LC_ALL, "en_US.UTF-8");
    std::wstring min, max, original;
    std::wcout << L"Исходная строка: ";
    std::getline(std::wcin, original);
 
    const wchar_t * expr = L"[a-zA-Zа-яA-Я]+";
    boost::wregex rexp(expr);
    boost::wsregex_iterator begin(original.begin(), original.end(), rexp), end;
    std::for_each(begin, end, 
            [&](const boost::match_results<std::wstring::const_iterator> & sm) {
                    if (min.length() > sm[0].length()) min = sm[0];
                    if (min.length() == 0)             min = sm[0];
                    if (max.length() < sm[0].length()) max = sm[0];
            });
    std::wcout << "min: " << min << std::endl;
    std::wcout << "max: " << max << std::endl;
}

#include <iostream>
#include <sstream>
#include <iterator>
#include <algorithm>
#include <string>
#include <vector>
 
 
int main() {
   std::string const str = "If ranges are to be a feature of the language "
         "then they should probably be supported at language level "
         "rather than by some trick";
 
   std::istringstream iss(str);
   std::vector<std::string> words(
         (std::istream_iterator<std::string>(iss))
        , std::istream_iterator<std::string>());
   auto minmax = std::minmax_element(
          words.begin()
        , words.end()
        , [] (std::string const& lhs, std::string const& rhs) {
             return lhs.length() < rhs.length();
          });
 
   std::cout << "Word with minimum length (" << minmax.first->length()
         << "): " << *minmax.first << std::endl;
   std::cout << "Word with maximum length (" << minmax.second->length()
         << "): " << *minmax.second << std::endl;
}

#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
 
#include <boost/algorithm/string/trim.hpp>
#include <boost/algorithm/string/split.hpp>
 
 
int main() {
   std::wstring str = L"Дефрагментатор ntfs под linux,,,,,,,,,,,,,,,,,,,,,,,,,";
 
   boost::trim_if(str, boost::is_any_of(L" .,!?:;\"'()"));
   std::vector<std::wstring> words;
   boost::split(words, str, boost::is_any_of(L" .,!?:;\"'()"), boost::token_compress_on);
   auto minmax = std::minmax_element(
          words.begin()
        , words.end()
        , [] (std::wstring const& lhs, std::wstring const& rhs) {
             return lhs.length() < rhs.length();
          });
 
   std::wcout << L"Word with minimum length (" << minmax.first->length()
         << L"): " << *minmax.first << std::endl;
   std::wcout << L"Word with maximum length (" << minmax.second->length()
         << L"): " << *minmax.second << std::endl;
}