Tug of War

CodeChefOpen on judge ↗

Now in the same series there is another game named $Tug of War$.You are given the strength of $N$ players and for this game you need to find $X$ strongest people to win this game for our hero. But you cannot take $Kth$ person in the array as he is the enemy. Print the sum of strength of hero's team. ### Input - First line of input contains $N$. - Second line of input contains $N$ space separated

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI