{"trustable":true,"prependHtml":"\u003cstyle type\u003d\"text/css\"\u003e\n #problem-body \u003e pre {\n display: block;\n padding: 9.5px;\n margin: 0 0 10px;\n font-size: 13px;\n line-height: 1.42857143;\n word-break: break-all;\n word-wrap: break-word;\n color: #333;\n background: rgba(255, 255, 255, 0.5);\n border: 1px solid #ccc;\n border-radius: 6px;\n }\n\u003c/style\u003e\n","sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv id\u003d\"problem-body\"\u003e\n\t\u003cp\u003eThere are \u003cstrong\u003eN\u003c/strong\u003e people standing in a Queue. You are given the height of each person and the number of people who are taller and standing ahead of him. You have to find the position of each person.\u003c/p\u003e\r\n\u003ch3\u003eInput\u003c/h3\u003e\r\n\u003cp\u003eFirst line conatins a single integer \u003cstrong\u003eT\u003c/strong\u003e, the number of test cases. It is followed by \u003cstrong\u003eT\u003c/strong\u003e test cases each of which contains 3 lines. First line of each test case contains a single integer \u003cstrong\u003eN\u003c/strong\u003e. Second line contains \u003cstrong\u003eN\u003c/strong\u003e integers representing the heights of these \u003cstrong\u003eN\u003c/strong\u003e people. Third line also contains \u003cstrong\u003eN\u003c/strong\u003e integers denoting the number of taller people standing ahead of him.\u003c/p\u003e\r\n\u003ch3\u003eOutput\u003c/h3\u003e\r\n\u003cp\u003eOutput one line for each test case which contains the heights of the \u003cstrong\u003eN\u003c/strong\u003e people in the order in which they are standing.\u003c/p\u003e\r\n\u003ch3\u003eConstraints\u003c/h3\u003e\r\n\u003cp\u003e0 \u0026lt; T \u0026lt;\u003d 20\u003cbr\u003e 0 \u0026lt; N \u0026lt;\u003d 10000\u003c/p\u003e\r\n\u003cp\u003e\u0026nbsp;\u003c/p\u003e\r\n\u003cp\u003eExpected Time Complexity \u003d O(N log N)\u003c/p\u003e\r\n\u003cp\u003e\u0026nbsp;\u003c/p\u003e\r\n\u003ch3\u003eExample\u003c/h3\u003e\r\n\u003cdiv\u003e\u003ctable class\u003d\"vjudge_sample\"\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e1\r\n5\r\n33 11 22 44 55\r\n0 2 1 1 0\r\n\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e33 22 11 55 44\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n\u003c/div\u003e\r\n\u003cp\u003eEasier Version : \u003ca href\u003d\"https://www.spoj.com/problems/QUE2/QUE1/\" target\u003d\"_blank\"\u003eQueue (Rookie)\u003c/a\u003e\u003c/p\u003e\r\n\u003cdiv id\u003d\"blockColorblindContent\"\u003e\u003c/div\u003e\n\u003c/div\u003e"}}]}