CF639A Bear and Displayed Friends

# 题目表述 Limak有n个朋友，他与第i个朋友的友谊值是ti，题目保证不会出现两个朋友的友谊值相同。 有一天，Limak上网和朋友聊天，此时只有Limak在线，接下来，会有一些朋友陆续上线。 系统会显示在线的朋友，但如果超过k个，系统只会显示ti最大的k个。 你的任务是处理两种查讯: “1 id”表示id号的朋友上线，保证他以前没有在线； “2 id”检测系统会不会显示id号的朋友，在单独一行中输出“YES”或“NO”。

第1行，n、k、q (1

对于每个type=2的询问，如果系统会显示这个人，在单独的一行中输出“YES”，否则输出“NO”。

In the first sample, Limak has $ 4 $ friends who all sleep initially. At first, the system displays nobody because nobody is online. There are the following $ 8 $ queries: 1. "1 3" — Friend $ 3 $ becomes online. 2. "2 4" — We should check if friend $ 4 $ is displayed. He isn't even online and thus we print "NO". 3. "2 3" — We should check if friend $ 3 $ is displayed. Right now he is the only friend online and the system displays him. We should print "YES". 4. "1 1" — Friend $ 1 $ becomes online. The system now displays both friend $ 1 $ and friend $ 3 $ . 5. "1 2" — Friend $ 2 $ becomes online. There are $ 3 $ friends online now but we were given $ k=2 $ so only two friends can be displayed. Limak has worse relation with friend $ 1 $ than with other two online friends ( $ t_{1}<t_{2},t_{3} $ ) so friend $ 1 $ won't be displayed 6. "2 1" — Print "NO". 7. "2 2" — Print "YES". 8. "2 3" — Print "YES".