The problem link is http://www.spoj.com/problems/LIS2/

I used the nlogn algorithm for longest increasing subsequence. This is my code http://ideone.com/rmaQSE#

I am getting the correct answer for the sample test case given in the problem in g++11 compiler. But i am getting wrong answer #1 for my submission in spoj. could someone go through my code and tell me where i am going wrong!