Modulo Sorting

CodeChefOpen on judge ↗

Manju likes the number K. He also likes those numbers which leave a large remainder when divided by K.Given an array of N integers,Find the sum of first M numbers whose remainder when divided by K is as large as possible.If two numbers evalute to same remainder when divided by K,consider the larger number to be greater. In a formal way,find the sum of the first M numbers whose a[i]%K is as large

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