Describe an efficient algorithm that, given a set \{x_1, x_2, \ldots, x_n\}{x 1 ,x 2 ,…,x n} of points on the real line, determines the smallest set of unit-length closed intervals that contains all of the given points. argue that your algorithm is correct.

my answer got deleted but it's a

step-by-step explanation:

greater than one

step-by-step explanation:

let x and 400 - x be the two numbers.  

==> 0.80x + 0.85(400 - x) = 400 - 68 from the statement of the problem.  

< ==> 0.80x + 0.85(400 - x) = 400 - 68  

==> 340 - 0.05x = 332  

< ==> -0.05x = -8 ==> x = 160, the first number ==> 400 - x = 240, the second number.