首页 > 代码库 > Codeforces Round #260 (Div. 2) A. Laptops（简单题）

Codeforces Round #260 (Div. 2) A. Laptops（简单题）

2024-07-16 16:00:58   227人阅读

题目链接：http://codeforces.com/problemset/problem/456/A


A. Laptops
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

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

代码如下：

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;

struct aa
{
    int p, q;
}a[100017];

bool cmp(aa a, aa b)
{
    return a.p < b.p; 
}
int main()
{
    int n;
    int i;
    while(~scanf("%d",&n))
    {
        memset(a,0,sizeof(a));
        for(i = 0; i < n; i++)
        {
            scanf("%d%d",&a[i].p,&a[i].q);
        }
        sort(a,a+n,cmp);
        int flag = 0;
        for(i = 1;  i < n; i++)
        {
            if(a[i-1].q > a[i].q)
            {
                flag = 1;
                break;
            }
        }
        if(flag)
            printf("Happy Alex\n");
        else
            printf("Poor Alex\n");
    }
    return 0;
}


联系
我们