THE SEIGE

CodeChefOpen on judge ↗

The Stark Kingdom has $N$ cities (numbered 1 to $N$) representing a connected undirected graph. There are $M$ bidirectional roads connecting any two cities. $ith$ city has $A_i$ soldiers. The Lannisters secretly sent an army to the Stark Kingdom to defeat them. When the Starks came to know of this, very little time was left and they had to gather a huge army. Warlords of $X$ cities $D_1, D_2, D_

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