10474 - Where is the Marble?

Difficulty : easy

Solution Description :

Sorting and searching problem

First sort the input
Next find the position for each query
You can get it within time limit using binary search, too. But you must use a faster (n log n) sorting algorithm. 

If you find the query value then print found at position
else print not fount