Feedback | | If you notice incorrect translations in Contester, please let author know.
|
|
Time limit 2000/4000/4000/4000 ms. Memory limit 65000/65000/65000/65000 Kb.
Difficulty Alpha
There are n
children who want to go to a Ferris wheel, and your task is to find a gondola for each child.
Each gondola may have one or two children in it, and in addition, the total weight in a gondola may not exceed x
. You know the weight of every child.
What is the minimum number of gondolas needed for the children?
Input
The first input line contains two integers n
and x
: the number of children and the maximum allowed weight.
The next line contains n
integers p1,p2,…,pn
: the weight of each child.
Output
Print one integer: the minimum number of gondolas.
Constraints
- 1≤n≤2⋅105
- 1≤x≤109
- 1≤p(i)≤x
Example
Input:
4 10
7 2 3 9
Output:
3
Для отправки решений необходимо выполнить вход.
|