SPOJ 127. Johnny Goes Shopping (Challenge)
Problem code: JOHNNY
–AC– ( but less points)
proceedure:
find the sum half it and then sort the array and accordingly store the positions and then find the sum of the sorted array which is nearest to half the sum of weights.



try to check ur code for time limit. Java is some what slower than c, c++ . u need a good code in java..