Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <algorithm>
- #include <iostream>
- #include <string>
- #include <vector>
- using namespace std;
- #define int long long
- struct Person {
- string name, phone_number;
- int price;
- };
- bool comp(const Person& lhs, const Person& rhs) {
- if (lhs.price == rhs.price) {
- if (lhs.name == rhs.name) {
- return lhs.phone_number < rhs.phone_number;
- }
- return lhs.name < rhs.name;
- }
- return lhs.price > rhs.price;
- }
- signed main() {
- ios_base::sync_with_stdio(0);
- cin.tie(nullptr);
- int n;
- cin >> n;
- vector<Person> persons(n);
- for (int i = 0; i < n; ++i) {
- cin >> persons[i].name >> persons[i].phone_number >> persons[i].price;
- }
- sort(persons.begin(), persons.end(), comp);
- for (int i = 0; i < min(size_t(10), persons.size()); ++i) {
- cout << persons[i].name << ' ' << persons[i].phone_number << ' ' << persons[i].price << '\n';
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement