problem link SPOJ.com - Problem SOLDIER also on codechef

gor, a famous russian soldier, must go

to war in Afghanistan (we are in late

80’s). His superiors allowed him to

buy himself his equipment. So, he must

buy 6 items: helmet, bulletproof vest,

trousers, boots, tunic and a firearm.

This items are represented with

numbers from 1 to 6. There are N( 6 <

N < 101 ) items of this 6 types. Each

item is characterized by its price

p[i] (in rublas ) and is quality q[i].

Igor has T (0 < T < 1001 ) rublas and

he wants to maximize the total quality

of his equipment. The total quality is

the quality of the item with the

lowest quality. Help him. InputOn the first line there are two

integers N and T. On the lines 2 …

N+1 there are 3 integers, type[i]

(from 1 to 6) p[i] and q[i]. ( 0 < p[

i ], q[ i ] < T ) OutputOutput the total quality.

my accepted solution WIygQJ - Online C++0x Compiler & Debugging Tool - Ideone.com or CodeChef: Practical coding for everyone

i doubt the correctness of solution

please explain why is the solution correct, or is it incorrect and test cases were weak