RATING  Coder Ratings
Some of the more elite (and notsoelite) coders around take part in a certain unnamed programming contest. In said contest, there are multiple types of competitions. Here, we consider the Open and High School competition types. For each type, each competitor receives a rating, an integer between 1 and 100000, inclusive. A coder's rating is based upon his or her level of performance in matches and is calculated using a complicated formula which, thankfully, you will not be asked to implement.
Although the Open and High School ratings for a coder who has participated in both competition types lately are usually close, this is not always the case. In particular, High School matches are more about speed, since many coders are able to solve all the problems, whereas Open matches require more thinking and there is a steeper curve in terms of problem difficulty.
Problem Statement
You are given N coders (1 ≤ N ≤ 300000), conveniently numbered from 1 to N. Each of these coders participates in both High School and Open matches. For each coder, you are also given an Open rating A_{i} and a High School rating H_{i}. Coder i is said to be better than coder j if and only if both of coder i's ratings are greater than or equal to coder j's corresponding ratings, with at least one being greater. For each coder i, determine how many coders coder i is better than.
Input Format
On the first line of input is a single integer N, as described above.
N lines then follow. Line i+1 contains two spaceseparated integers, A_{i} and H_{i}.
Output Format
Line i should contain the number of coders that coder i is better than.
Sample Input
8 1798 1832 862 700 1075 1089 1568 1557 2575 1984 1033 950 1656 1649 1014 1473
Sample Output
6 0 2 4 7 1 5 1
hide comments
sanyajenee02:
20181023 10:58:01
can anyone please post the solution .please 

abhimanyu_1998:
20180927 19:48:19
Time Limit Exceeded in java


ritvik_1999:
20180718 08:29:56
Nice Problem !!


aish_dutt:
20171221 10:57:12
Those who are getting WA on 9th testcase, check for the below testcase ::


akt_1998:
20170624 23:32:12
Easy :)


SUBHAM SANGHAI:
20170622 21:01:24
Sorting+BIT ..


spk:
20160817 18:06:46
BIT+hashing, AC in 0.33 

mohab3333:
20160809 01:33:23
if You'r using BST make the max value 300000 ;) 

youssefelsa3ed:
20160809 01:31:37
Easy one.


Tiago NĂ¡poli:
20160714 17:32:26
Case:

Added by:  Brian Bi 
Date:  20090410 
Time limit:  0.176s1.846s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 NODEJS OBJC PERL6 SQLITE VB.NET 
Resource:  own problem 