|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||128 MB||0||0||0||0.000%|
Multiple choice tests are rather easy to grade, and therefore very popular among some teachers. Some students like them (“you have a chance to get the answer right even if you have no clue”), some students hate them (“there must be a hidden catch somewhere”). The ultimate form of multiple choice questions are true/false ones.
Now assume that you are taking a true/false test. For each question, you have an a priori estimate of how likely each of the two answers is right. For question i, you think that the answer is “Yes” with probability yi, and “No” with probability 1 − yi. So of course, you should just pick whichever is higher between yi and 1 − yi (if yi = 1/2, you could go either way).
The catch? If your estimate of “Yes” is higher than for “No” for all questions, you may suspect something is fishy. Most teachers don’t like clear patterns in their answer key, and try to mix things up. Suppose that you know that this particular teacher always has a number of “Yes” answers between ℓ and r (inclusive), for some ℓ ≤ r. Then, picking the set of questions to answer “Yes”, maximizing your total expected number of correct answers is not quite trivial any more. So you had better write a program to do it. Specifically, you want to find the answers to give to all questions so as to maximize the expected number of questions you get right, but giving the answer “Yes” at least ℓ and at most r times.
The first line contains a number K ≥ 1, which is the number of input data sets in the file. This is followed by K data sets of the following form:
The first line of each data set contains three integers ℓ ≤ r ≤ n, where n ≤ 200 is the total number of questions on the exam, ℓ is the minimum number of questions on which the answer will be “Yes”, and r the maximum number.
This is followed by n lines, each giving a fractional number yi ∈ [0, 1] for the corresponding question i.
For each data set, first output “Data Set x:” on a line by itself, where x is its number. Then, output the maximum total number of questions you can get right subject to all the constraints, rounded to two decimals.
1 2 4 5 0.2 0.4 0.35 0.8 0.4
Data Set 1: 3.25