Minimize the sum of errors of representative integers

Question

Given n integers between [0,10000] as D₁,D₂...,D_n, where there may be duplicates, and n can be huge:

I want to find k distinct represent

Answer 1

one first obvious point is that your Rs must be chosen amongst your Ds. (if you choose an R that is any D - 1 (but not another D), you'll improve the answer by incrementing your R by 1)

a second point is that your last R is useless and its error will always be 0