Too Mean

CodeChefRating 2254Open on judge ↗

You are given an array $A$ of length $N$. You have to partition the elements of the array into some [subsequences](https://en.wikipedia.org/wiki/Subsequence) such that: - Each element $A_i$ $(1 \le i \le N)$ belongs to **exactly one** subsequence. - The [mean](https://en.wikipedia.org/wiki/Arithmetic_mean) of the mean of subsequences is **maximised**. Formally, let $S_1, S_2, \dots, S_K$ denote

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