CF 158B taxi

这道题理解错误；

之前的想法是快排后，尽可能的爆搜，让尽可能的凑出多的4个人；‘

但是题意并不如此；

题意：

        有n群小朋友要乘车，每群小朋友的人数最少1人，最多4人，一辆车最多可以坐4人

     ，同一个群的小朋友必须坐同一辆车，问最少需要多少辆车。

算法理解：

贪心：四个人的肯定一车；

                  三个人的能多加一个人就一个人；

  两个人的两人一辆车，如果剩下最后一组两人的，则能多加一人是一人；

  剩下一人的就尽可能的组为四个人，如果有最后剩下的就多占一辆车；

题目：

B. Taxi

time limit per test

3 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

After the lessons n groups of schoolchildren went outside and decided to visit Polycarpus to celebrate his birthday. We know that the i-th group consists of si friends (1 ≤ si ≤ 4), and they want to go to Polycarpus together. They decided to get there by taxi. Each car can carry at most four passengers. What minimum number of cars will the children need if all members of each group should ride in the same taxi (but one taxi can take more than one group)?

Input

The first line contains integer n (1 ≤ n ≤ 105) — the number of groups of schoolchildren. The second line contains a sequence of integers s1, s2, ..., sn (1 ≤ si ≤ 4). The integers are separated by a space, si is the number of children in the i-th group.

Output

Print the single number — the minimum number of taxis necessary to drive all children to Polycarpus.

Examples

input

5
1 2 4 3 3

output

4

input

8
2 3 4 4 2 1 3 1

output

5

Note

In the first test we can sort the children into four cars like this:

• the third group (consisting of four children),
• the fourth group (consisting of three children),
• the fifth group (consisting of three children),
• the first and the second group (consisting of one and two children, correspondingly).

There are other ways to sort the groups into four cars.

AC代码：

#include <cstdio>
#include <algorithm>

using namespace std;

const int maxn = 100000 + 10;
int s[maxn];

int main()
{
    int n, i;
    while(~scanf("%d", &n))
    {
        int one = 0, two = 0, three = 0, four = 0;
        for(i = 0; i < n; i++)//*存储类别； 
        {
            scanf("%d", &s[i]);
            switch(s[i])
            {
                case 1:one++;break;
                case 2:two++;break;
                case 3:three++;break;
                case 4:four++;break;
            }
        }
        int cnt = four + three + two/2;//*最初的至少是这么多；既three>one的情况，two不需要多加人且两两一车； 
        if(one > three) one -= three; //*one在拼入three还剩下的人； 
        else one = 0;
        two %= 2;//*two能不能剩下最后一辆； 
        if(two == 1)
        {
            cnt++;
            if(one > 2) one -= 2; //*one剩下的人尽可能的拼入，最多2人； 
            else one = 0;
        }
        cnt += one / 4;//*剩下的one四人一车； 
        if(one % 4 != 0) cnt++;//*如果剩余的人不足四人，单独拼一辆车； 
        printf("%d\n", cnt);
    }
    return 0;
}