fork download 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. #define ms(s,n) memset(s,n,sizeof(s))
  5. #define all(a) a.begin(),a.end()
  6. #define present(t, x) (t.find(x) != t.end())
  7. #define sz(a) int((a).size())
  8. #define FOR(i, a, b) for (int i = (a); i < (b); ++i)
  9. #define FORd(i, a, b) for (int i = (a) - 1; i >= (b); --i)
  10. #define pb push_back
  11. #define pf push_front
  12. #define fi first
  13. #define se second
  14. #define mp make_pair
  15.  
  16. typedef long long ll;
  17. typedef unsigned long long ull;
  18. typedef long double ld;
  19. typedef pair<int,int> pi;
  20. typedef vector<int> vi;
  21. typedef vector<pi> vii;
  22.  
  23. const int MOD = (int) 1e9+7;
  24. const int INF = (int) 1e9+1;
  25. inline ll gcd(ll a,ll b){ll r;while(b){r=a%b;a=b;b=r;}return a;}
  26. inline ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
  27.  
  28.  
  29. void FileIO(){
  30. 	freopen("input.txt","r", stdin);
  31. 	freopen("output.txt","w",stdout);
  32. }
  33.  
  34.  
  35. bool cmp(pi a,pi b){
  36. 	if(a.fi != b.fi)
  37. 		return a.fi<b.fi;
  38. 	return a.se<b.se;
  39. }
  40. int main(){
  41. 	//FileIO();
  42. 	ios::sync_with_stdio(false);
  43. 	cin.tie(nullptr);
  44. 	cout.tie(nullptr);
  45. 	int n;cin>>n;
  46. 	vector<pi> a(n);
  47. 	FOR(i,0,n){
  48. 		cin>>a[i].fi>>a[i].se;
  49. 	}
  50. 	sort(all(a),cmp);
  51. 	for(int i=0;i<n-1;i++){
  52. 		if(a[i].se>a[i+1].se){
  53. 			cout<<"Happy Alex";
  54. 			return 0;
  55. 		}
  56. 	}
  57. 	cout<<"Poor Alex";
  58. }
Success #stdin #stdout 0.01s 5504KB
comments (?)
stdin 
Standard input is empty
stdout 
Poor Alex
https://ideone.com/yrIT9i
language:
C++14 (gcc 8.3)
created:
3 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!