Hi!

I know the quoted round and problem is really old, but, just for the sake of correctness of the editorial for all those who might stumble upon it while practicing from the a2oj ladders, I believe an update to reflect the correct solution/approach would be nice and help prevent confusion.

This is the problem: https://mirror.codeforces.com/contest/456/problem/A

And, this is the editorial: https://mirror.codeforces.com/blog/entry/13336

The editorial says a check to compare all a[i] to b[i] should be sufficient to solve the problem whereas it isn't. The following sample case would print "Happy Alex" whereas it should print "Poor Alex".

Case: 5 1 1 2 2 3 3 4 25 5 30