Minimum Sum

CodeChefOpen on judge ↗

There is an array of N integers. But, Chef is interested in X integers of the array such that their sum is minimum. Find the minimum possible sum of X integers. Elements of the array can be negative. Constraints $1 \leq T \leq 100$ $1 \leq N \leq 100$ $1 \leq X \leq N$ Input: The first line contains an integer T --- the number of test cases. The first line of each test case consists

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