Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <string>
- #include <vector>
- using namespace std;
- struct computer
- {
- int p;
- int q;
- };
- int main()
- {
- int n;
- cin >> n;
- vector<computer> arr(n);
- for (int i = 0; i < n; i++)
- {
- int a, b;
- cin >> a >> b;
- arr[i].p = a;
- arr[i].q = b;
- }
- int maxp = arr[0].p;
- for (int i = 0; i < n; i++)
- {
- if (arr[i].p > maxp)
- maxp = arr[i].p;
- }
- vector<computer> numsp(maxp + 1);
- for (int i = 0; i < n; i++)
- numsp[arr[i].p] = arr[i];
- vector<computer> computers;
- for (int i = 0; i < maxp + 1; i++)
- {
- for (int z = 0; z < numsp[i].p; z++)
- computers.push_back(numsp[i]);
- }
- int num = 0;
- for (int i = 1; i < n; i++)
- {
- if (computers[i].q < computers[i - 1].q)
- num++;
- }
- if (num != 0)
- cout << "Happy Alex" << endl;
- else
- cout << "Poor Alex" << endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement