Урок 4 идиома...

kutuzzzov

May 22nd, 2023

1,018

Never

Add comment

Not a member of Pastebin yet? Sign Up, it unlocks many cool features!

C++ 3.67 KB | None | 0 0

raw download clone embed print report

#include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
template <typename Iterator>
class IteratorRange {
public:
IteratorRange(Iterator begin, Iterator end)
: first(begin)
, last(end) {
}
Iterator begin() const {
return first;
}
Iterator end() const {
return last;
}
private:
Iterator first, last;
};
template <typename Collection>
auto Head(Collection& v, size_t top) {
return IteratorRange{v.begin(), next(v.begin(), min(top, v.size()))};
}
struct Person {
string name;
int age, income;
bool is_male;
};
vector<Person> ReadPeople(istream& input) {
int count;
input >> count;
vector<Person> result(count);
for (Person& p : result) {
char gender;
input >> p.name >> p.age >> p.income >> gender;
p.is_male = gender == 'M';
}
return result;
}
int main() {
vector<Person> people = ReadPeople(cin);
sort(people.begin(), people.end(),
[](const Person& lhs, const Person& rhs) {
return lhs.age < rhs.age;
});
for (string command; cin >> command;) {
if (command == "AGE"s) {
int adult_age;
cin >> adult_age;
auto adult_begin = lower_bound(people.begin(), people.end(), adult_age,
[](const Person& lhs, int age) {
return lhs.age < age;
});
cout << "There are "s << distance(adult_begin, people.end()) << " adult people for maturity age "s
<< adult_age << '\n';
} else if (command == "WEALTHY"s) {
int count;
cin >> count;
auto head = Head(people, count);
partial_sort(head.begin(), head.end(), people.end(),
[](const Person& lhs, const Person& rhs) {
return lhs.income > rhs.income;
});
int total_income = accumulate(head.begin(), head.end(), 0, [](int cur, const Person& p) {
return p.income + cur;
});
cout << "Top-"s << count << " people have total income "s << total_income << '\n';
} else if (command == "POPULAR_NAME"s) {
char gender;
cin >> gender;
IteratorRange range{people.begin(), partition(people.begin(), people.end(),
[gender](const Person& p) {
return p.is_male == (gender == 'M');
})};
if (range.begin() == range.end()) {
cout << "No people of gender "s << gender << '\n';
} else {
sort(range.begin(), range.end(),
[](const Person& lhs, const Person& rhs) {
return lhs.name < rhs.name;
});
string* most_popular_name = &range.begin()->name;
int count = 1;
for (auto i = range.begin(); i != range.end();) {
auto same_name_end = find_if_not(i, range.end(),
[i](const Person& p) {
return p.name == i->name;
});
auto cur_name_count = distance(i, same_name_end);
if (cur_name_count > count) {
count = cur_name_count;
most_popular_name = &i->name;
}
i = same_name_end;
}
cout << "Most popular name among people of gender "s << gender << " is "s << *most_popular_name << '\n';
}
}
}
}

Add Comment

Please, Sign In to add comment