zoukankan      html  css  js  c++  java
  • 浙南联合训练赛 B-Laptops

    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).

    Examples

    Input
    2
    1 2
    2 1
    Output
    Happy Alex
    #include<iostream>
    #include<cstdio>
    #include<cstring>
    #include<algorithm>
    using namespace std;
    const int m=1e6+10;
    struct node
    {
        int x,y;
    }a[m];
    bool  cmp(node a,node b)
    {
        return a.x < b.x;
    }
    int main()
    {
        int n;
        while(cin>>n)
        {
            for(int i=0;i<n;i++)
                scanf("%d %d",&a[i].x,&a[i].y);
            sort(a,a+n,cmp);
            int flag=1;
            for(int i=1;i<n;i++)
            {
                if(a[i].x>a[i-1].x&&a[i].y<a[i-1].y)
                {
                    flag=0;
                    cout<<"Happy Alex"<<endl;
                    break;
                }
            }
            if(flag)
                cout<<"Poor Alex"<<endl;
        }
    }
  • 相关阅读:
    1365 Fib(N) mod Fib(K) [斐波那契相关]
    51nod1439 互质对 [莫比乌斯函数, 容斥]
    UVA1642 魔法GCD Magical GCD [gcd, 双向链表]
    李超线段树学习笔记 [模板]
    P4297 [NOI2006]网络收费 [树形dp]
    田忌赛马 [贪心(完成) / 动态规划(待填坑)]
    菌落 [状压dp?]
    异或约数和 [异或相关]
    java 驼峰命名
    java 静态构造函数
  • 原文地址:https://www.cnblogs.com/andrew3/p/8902404.html
Copyright © 2011-2022 走看看