fork download
  1. #include <vector>
  2. #include <set>
  3. #include <algorithm>
  4. #include <iostream>
  5.  
  6. std::set<std::string> InsertByLength(std::vector<std::string> src)
  7. {
  8. std::sort(src.begin(), src.end(), [](const std::string& a, const std::string& b)
  9. {
  10. return a.size() < b.size();
  11. });
  12.  
  13. std::set<std::string> ret;
  14. for(auto s : src) {
  15. std::cout << s << std::endl;
  16. ret.insert(s);
  17. }
  18.  
  19. return ret;
  20. }
  21.  
  22. int main()
  23. {
  24. auto result = InsertByLength({
  25. "Apple", "Apricots", "Avocado", "Durian", "Fig", "Tangerine/Clementine",
  26. "Kumquat", "Lemon", "Pear", "Prunes" "Raspberries", "Strawberries",
  27. "Watermelon"});
  28.  
  29. std::cout << "Inserted: " << result.size() << " elements\n";
  30.  
  31. return 0;
  32. }
  33.  
Success #stdin #stdout 0s 3236KB
stdin
Standard input is empty
stdout
Fig
Pear
Apple
Lemon
Durian
Avocado
Kumquat
Apricots
Watermelon
Strawberries
PrunesRaspberries
Tangerine/Clementine
Inserted: 12 elements