Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <string>
- #include <vector>
- #include <iostream>
- #include <algorithm>
- #include <map>
- using namespace std;
- string FindWidespreadBird(const vector<string>& types) {
- map<string, int>birds;
- for (const auto& type : types) {
- ++birds[type];
- }
- auto pr = max_element(birds.begin(), birds.end(), [](const auto&x, const auto& y) { //алгоритмом max_element и лямбдой
- //нахожу ключ, значение которого
- //больше всех
- return x.second < y.second;
- });
- string bird = pr->first;
- return bird;
- }
- int main() {
- vector<string> bird_types1 = { "zyablik"s, "sinica"s, "vorobey"s, "zyablik"s, "sinica"s, "sinica"s };
- if (FindWidespreadBird(bird_types1) == "sinica"s) {
- cout << "Correct"s << endl;
- }
- else {
- cout << "Not correct"s << endl;
- }
- vector<string> bird_types2 = { "ruh"s, "sirin"s, "blue bird of fortune"s, "finist"s, "fenix"s };
- if (FindWidespreadBird(bird_types2) == "blue bird of fortune"s) {
- cout << "Correct"s << endl;
- }
- else {
- cout << "Not correct"s << endl;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement