Codeforces Round #260 (Div. 2) 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




题意分析:

题目的意思大概就是有很多笔记本电脑,电脑有两种属性,一个price,一个quality。看是否存在两台电脑中,有一个台的价格更低而且质量更好。直接对price升序排列,然后循环维护一个最大质量ma,如果ma大于后面电脑的quality就break,对应输出就KO了。




代码:

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;

const int MAXN = 100000+5;

struct node
{
    int a, b;
}di[MAXN];

int cmp(node x, node y)
{
    return x.a < y.a;
}

int main()
{
    int n, m;
    while(~scanf("%d", &n))
    {
        int i;
        for(i = 0;i < n;i++)
        {
            scanf("%d %d", &di[i].a, &di[i].b);
        }
        sort(di, di+n, cmp);
        int ma = 0;
        int ok = 0;
        for(i = 0;i < n;i++)
        {
            if(ma > di[i].b)
            {
                ok = 1;
                break;
            }
            ma = max(di[i].b, ma);
        }
        if(ok == 1)
        {
            printf("Happy Alex\n");
        }
        else
        {
            printf("Poor Alex\n");
        }
    }
    return 0;
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 2
    评论
评论 2
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值