CodeForces
来源:互联网 发布:上汽进出口 知乎 编辑:程序博客网 时间:2024/06/18 04:11
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.
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.
If Alex is correct, print "Happy Alex", otherwise print "Poor Alex" (without the quotes).
21 22 1
Happy Alex
就是问你没有这样两组数,他第一个数的第一个值比第二个数的第一个值要小,而第一个数的第二个值比第二个数的第二个值要大,我写的是 sort一发,for循环一发直接找,,,我看了一下网上的思路,发现自己少看了一个条件,那就是所有的ai和bi都是小于n 而且所有的ai 和bi是不能相同的,那就简单了啊,,只要有一个a和b是不相同的那么就一定会有满足的情况,直接输出就好了
上代码吧:
#include<stdio.h>#include<algorithm>using namespace std;struct node{int x,y;}a[100002];bool cmp(node a,node b){return a.x<b.x;}int main(){int n;int flag=0;scanf("%d",&n);for(int i=0;i<n;i++){scanf("%d%d",&a[i].x,&a[i].y);}sort(a,a+n,cmp);for(int i=1;i<n;i++){if(a[i-1].y>a[i].y){flag=1;break;}}if(flag){printf("Happy Alex\n");}else { printf("Poor Alex\n"); }}
#include <cstdio>#include <iostream>#include <algorithm>using namespace std;int main(){ bool ok=0; int m,a,b; cin>>m; for(int i=0; i<m; i++) { cin>>a>>b; if(a!=b) { ok=1; break; } } if(ok) puts("Happy Alex"); else puts("Poor Alex"); return 0;}
- codeforces~~~
- Codeforces
- codeforces
- Codeforces
- codeforces
- codeforces
- Codeforces
- Codeforces
- CodeForces
- CodeForces
- CodeForces
- CodeForces
- CodeForces
- Codeforces
- Codeforces
- Codeforces
- Codeforces
- Codeforces
- java中this关键字的基本使用
- Eclipse安装efxclipse插件(JavaFX工具)
- 暑期项目开发实训 Day5
- Linux系统CentOs7 安装mysql并启动
- 一个新手对java网站项目管理的理解,浅谈MVN,Git,SVN
- CodeForces
- 1248: Let the Balloon Rise
- iOS-浅谈runtime运行时机制01-类与对象的内部结构
- 华为面试---取近似值
- Android7.0须知--应用间共享文件(FileProvider) log: exposed beyond app through Intent.getData()
- C语言笔记-基于C语言实现的流水跑马灯
- 典型的找不到mapper映射文件的异常 Invalid bound statement 异常
- Android transaction Fragment时按返回键直接退出,没有返回到上一个Fragment
- HDU 3076 ssworld VS DDD (概率dp)