CF 456A(Laptops-排序)

最新推荐文章于 2022-07-21 06:41:15 发布

原创最新推荐文章于 2022-07-21 06:41:15 发布 · 1.5k 阅读

0 ·

CC 4.0 BY-SA版权

杂题专栏收录该内容

50 篇文章

订阅专栏

本文通过编程解决了一个关于笔记本电脑价格与质量是否成正比的问题。通过对输入数据进行排序和对比，判断是否存在价格较低但质量更高的笔记本电脑，以此来验证价格与质量之间的关系。

One day Dima and Alex had an argument about the price and quality of laptops. Dima thinks that the more expensive a laptop is, the better it is. Alex disagrees. Alex thinks that there are two laptops, such that the price of the first laptop is less (strictly smaller) than the price of the second laptop but the quality of the first laptop is higher (strictly greater) than the quality of the second laptop.

Please, check the guess of Alex. You are given descriptions of n laptops. Determine whether two described above laptops exist.

Input

The first line contains an integer n (1 ≤ n ≤ 105) — the number of laptops.

Next n lines contain two integers each, ai and bi (1 ≤ ai, bi ≤ n), where ai is the price of the i-th laptop, and bi is the number that represents the quality of the i-th laptop (the larger the number is, the higher is the quality).

All ai are distinct. All bi are distinct.

Output

If Alex is correct, print "Happy Alex", otherwise print "Poor Alex" (without the quotes).

Sample test(s)

input
2
1 2
2 1

output
Happy Alex

先按b排序，再比较a

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<functional>
#include<iostream>
#include<cmath>
#include<cctype>
#include<ctime>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Lson (x<<1)
#define Rson ((x<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,127,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define INF (2139062143)
#define F (100000007)
#define MAXN (100000+10)
long long mul(long long a,long long b){return (a*b)%F;}
long long add(long long a,long long b){return (a+b)%F;}
long long sub(long long a,long long b){return (a-b+(a-b)/F*F+F)%F;}
typedef long long ll;
struct node
{
	int a,b;
	friend bool operator<(node a,node b){return a.b<b.b;	}
}a[MAXN];
int n;
int main()
{
	freopen("a.in","r",stdin);
//	freopen("a.out","w",stdout);
	cin>>n;
	For(i,n) scanf("%d%d",&a[i].a,&a[i].b);
	sort(a+1,a+1+n);
	For(i,n-1) if (a[i].a>a[i+1].a) {cout<<"Happy Alex"<<endl; return 0;	}
	
	
	cout<<"Poor Alex"<<endl;
	return 0;
}