Help me in solving TACHSTCK1 problem

help
,
1

My issue

I guess this is wrongly answered
id d=10 then we can pick smallest 2 chopstics of length 20 and 30.

Learning course: Greedy Algorithms
Problem Link: CodeChef: Practical coding for everyone