|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||128 MB||44||32||28||70.000%|
We are organizing a canoe tour. Canoes can be hired at the harbour. Canoes are all alike. A canoe can take at most two persons. The sum of weights of these persons cannot exceed the fixed maximal weight. We want to pay as little as possible so we should try to place all participants of our tour in the minimal number of canoes.
Write a program that:
In the first line of the standard input there is one integer w, 80 ≤ w ≤ 200, which is the maximal weight of a canoe crew. In the second line there is one integer n, 1 ≤ n ≤ 30,000, which is the number of participants of the tour.
Each of the following n lines contains one integer from the range [5..w]. These numbers equal the weights of the participants.
In the first line of the standard output there should be written one integer — the minimal number of canoes that should be hired.
100 9 90 20 20 30 50 60 70 80 90