A8411 | Taxi
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
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 $s_{i}$ friends ( $1<=s_{i}<=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)?
输入格式
The first line contains integer $n$ ( $1<=n<=10^{5}$ ) — the number of groups of schoolchildren. The second line contains a sequence of integers $s_{1},s_{2},...,s_{n}$ ( $1<=s_{i}<=4$ ). The integers are separated by a space, $s_{i}$ is the number of children in the $i$ -th group.
输出格式
Print the single number — the minimum number of taxis necessary to drive all children to Polycarpus.
输入输出样例
输入 #1
5 1 2 4 3 3
输出 #1
4
输入 #2
8 2 3 4 4 2 1 3 1
输出 #2
5
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.
- 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.
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted