C++ lambda algorithm

#include <algorithm>
#include <vector>
#include <string>
#include <iostream>

std::string make_plural(size_t ctr, const std::string &word, const std::string &ending)
{
return (ctr > 1) ? word + ending : word;
}

void elimDups(std::vector<std::string> &words)
{
std::sort(words.begin(), words.end());
auto end_unique = std::unique(words.begin(), words.end());
words.erase(end_unique, words.end());
}

void biggies(std::vector<std::string> &words, std::vector<std::string>::size_type sz)
{
elimDups(words);
std::stable_sort(words.begin(), words.end(),
[](const std::string &left, const std::string &right)
{ return left.size() < right.size(); });
auto wc = std::find_if(words.begin(), words.end(),
[sz](const std::string &s){ return s.size() >= sz; });
auto count = words.end() - wc;
std::cout << count << make_plural(count, "word", "s")
<< " of length " << sz << " or longer" << std::endl;
std::for_each(wc, words.end(),
[](const std::string &s) { std::cout << s << " "; });
std::cout << std::endl;
}
int main()
{
std::vector<std::string> words;
std::string str;

while (std::cin >> str) {
words.push_back(str);
}
biggies(words, 5);
return 0;
}