Найти лучшее решение - C++ - Ответ 1830914

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
 
using namespace  std;
 
void Tokenize(const string& str,
              vector<string>& tokens,
              const string& delimiters = " ")
{
    string::size_type lastPos = str.find_first_not_of(delimiters, 0);
    string::size_type pos     = str.find_first_of(delimiters, lastPos);
 
    while (string::npos != pos || string::npos != lastPos)
    {
        tokens.push_back(str.substr(lastPos, pos - lastPos));
        lastPos = str.find_first_not_of(delimiters, pos);
        pos = str.find_first_of(delimiters, lastPos);
    }
}
 
bool myfn(string i, string j) { return i.size()<j.size(); }
 
int main(int argc, char* argv[])
{
    string line1 = "We were her pride of 10 she named us:";;
    string line2 = "Benjamin, Phoenix, the Prodigal";
    string line3 = "and perspicacious pacific Suzanne";
 
    string sentance = line1 + ' ' + line2 + ' ' + line3;
 
    vector<string> tokens;
    vector<string>::iterator it;
 
    ostream_iterator<string> cit(cout, "\n");
 
    Tokenize(sentance, tokens);
 
    cout << "Sentance: " << sentance << endl;
    cout << "\nSentance has " << tokens.size() << " word." << endl;
 
    vector<string>::iterator sWord = min_element(tokens.begin(), tokens.end(), myfn);
    vector<string>::iterator bWord = max_element(tokens.begin(), tokens.end(), myfn);
 
    cout << "\nSentance' word:" << endl;
    copy(tokens.begin(), tokens.end(), cit);
 
    cout << "\nThe biggest word: " << endl;
    for (it = tokens.begin(); it != tokens.end(); it++)
    {
        if (it->size() >= bWord->size())
            cit = *it;
    }
 
    cout << "\nThe smallest word: " << endl;
    for (it = tokens.begin(); it != tokens.end(); it++)
    {
        if (it->size() <= sWord->size())
            cit = *it;
    }
 
    cin.get();
    return 0;
}