CodeForces - 158B Taxi

最新推荐文章于 2019-09-03 23:13:24 发布

QuteMelon

最新推荐文章于 2019-09-03 23:13:24 发布

阅读量496

点赞数

CC 4.0 BY-SA版权

分类专栏： HDU刷题文章标签： ACM

本文链接：https://blog.youkuaiyun.com/weixin_43508782/article/details/84626472

博客介绍了CodeForces上的158B Taxi题目，讨论了如何安排不同人数的学校小组共乘出租车的问题，确保每组成员都在同一辆车上，并且使用最少的车辆。给出的输入和输出示例展示了如何计算最少所需出租车数量。文章还提到了解题思路，即优先考虑四人组，然后组合三人组和一人组，最后处理二人组。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

B题 Taxi

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.

题意大概就是：一帮熊孩子要出游，然后一辆车最多只能乘4个人，然后同组的人一定要在同一辆车上，请问最少要几辆车。

思路：四人一组的那么就一辆车，然后看三人一组的与一人一组的搭配，再看二人一组的。

AC代码：


    #include <iostream>
    #include <algorithm>
    using namespace std;
    const

最低0.47元/天解锁文章

200万优质内容无限畅学