TEMPLEQ  Temple Queues
The Tirumala temple is the most visited place of worship in the world. As the number of pilgrims who visit the temple each day is very high, the head of the temple should keep monitoring the queue system. Today is another lovely day and he has started his work. There are N queues at the entrance of the temple and some of them are already filled with pilgrims. Each queue has a metal door at the beginning, which leads to the temple. When the door is opened, it allows only one pilgrim to get through it and it gets closed immediately after that. 
New pilgrims are rushing in to the queues and the head needs to monitor the current sizes of the queues and decide which doors to be opened. At any time, he wants to know how many queues currently have at least X pilgrims. He also decides an integer Y and wants to open the doors of all the queues having at least Y pilgrims at that time. You are the controller of the queue system and are following his instructions. Respond quickly and win yourself a big laddu (sweet) from him :) .
Read the input section for rest of the details.
Input
The first line contains two integers N and Q. N  The number of queues [ 1 <= N <= 100,000 ], Q  The number of queries [ 0 <= Q <= 500,000 ] . The second line contains N integers, which are the initial sizes of the queues. ith integer ( 1based ) is the initial size of queue i [ 0 <= initial size <= 100,000,000 ]
Each of the next Q lines is one of the following
1 A [ One pilgrim enters the queue# A ( 1 <= A <= N ) ]
2 X [ Find the number of queues having atleast X pilgrims currently ( 0 <= X <= 1,000,000,000 ) ]
3 Y [ Open the doors of all the queues having atleast Y pilgrims ( 1 <= Y <= 1,000,000,000 ), and thus allowing only one pilgrim to enter the temple from each of them ]
Output
For each query of type "2 X" , print the answer in a new line.
Example
Input:
5 6
20 30 10 50 40
2 31
1 2
2 31
3 11
2 20
2 50
Output:
2
3
3
0
Note : Ideal time limit should be 2s. It has been increased to 7s, to let Java solutions pass, as the i/o is huge.
* There are multiple test sets, and the judge shows the sum of the time taken over all test sets of your submission, if Accepted.
hide comments
vagesh_verma:
20170226 20:12:22
(N+Q)log(N) solution.. 

Abhinandan Agarwal:
20170226 13:48:15
my complexity  C*(n+q). C is around 30 . 

ashish kumar:
20151216 08:15:33
I am getting WA please check my solution or provide some testcases ? 

sayantan ghosh:
20150728 15:14:53
can someone provide good testcases?I am getting wa. 

Jannatul Ferdows Jenny:
20150708 13:12:16
Very unique problem. Kudos to setter. 

Archit Jain:
20140709 16:31:15
Nice !! Last edit: 20170326 19:16:31 

random:
20110531 17:19:47
fast i/o really reduced the run time by a lot !


Ravi Kiran:
20110530 07:21:42
Nice problem. Last edit: 20110530 12:30:43 

Anil Kishore:
20110226 14:51:24
This increase in time limit makes a O( n log n + q log^2 n ) pass too, while we expected a O( ( n + q ) log n ). If you are using C / C++, then a total time of around 6s ( on all test sets ) is better.

Added by:  Anil Kishore 
Date:  20110225 
Time limit:  0.935s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Resource:  CodeMutants 2011 , DAIICT, India 