How to find the minimum sequence of n elements whose sum would be >= x, even if you subtract any k elements from the sequence?

Question

Algorithms

What should such an algorithm look like? Given the input number of elements n, the minimum sum x and the number of elements that can remove (A may not remove) k, you need to find such elements that their sum would be minimal, but would always be greater than or equal to x, and the number itself there would be n elements.

Answer 1

From the wording of the question, it seems to me that this problem should be solved analytically.
Why can't all n elements be x / (n - k)? Then removing any k will give x.