Problem--158B--Codeforces--Taxi
2017-03-05 20:59
477 查看
Taxi
time limit per test3 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard 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.
time limit per test3 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard 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.
#include<stdio.h> int main(){ int n,num; scanf("%d",&n); int box[5]={0,0,0,0,0}; for(int i=0;i<n;i++){ scanf("%d",&num); box[num]++; } int taxi=box[4]; while(box[3]--){ taxi++; if(box[1]>0) box[1]--; } taxi+=(box[2]/2); if(box[2]%2>0){ box[1]-=2; taxi++; } if(box[1]>0){ taxi+=(box[1]+3/4); } printf("%d\n",taxi); }
相关文章推荐
- codeforces 158B(Taxi) Java
- codeforces-158B-Taxi题解
- Codeforces contest 883 problem L. Berland.Taxi(Treap+优先队列)
- codeforces 158B - Taxi
- CodeForces 158 B. Taxi(模拟)
- Codeforces 158B - Taxi
- CodeForces 158 B. Taxi(模拟)
- Codeforces Round #427 (Div. 2) Problem C Star sky (Codeforces 835C) - 前缀和
- Codeforces 472D. Design Tutorial: Inverse the Problem(一种逆向判定树成立的办法,从Kruskal到dfs)
- Codeforces 706C Hard problem
- CodeForces 629 B. Far Relative’s Problem(水~)
- Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals) Problem E (Codeforces 828E) - 分块
- CodeForces 276E Little Girl and Problem on Trees 树状数组
- CodeForces--TechnoCup--2016.10.15--ProblemB--Bill Total Value(字符串处理)
- codeforces-A Trivial Problem 判断n!末尾0的个数模板
- 【codeforces】2014 Asia Xian Regional Contest G The Problem to Slow Down You 【Palindromic Tree】
- 【codeforces】2014-2015ACM-ICPC CERC 14 Problem J: Pork barrel 【LCT+主席树】
- Problem - 409C - Codeforces(brute force + math)
- 【codeforces】 Far Relative’s Problem
- CodeForces - 472D Design Tutorial: Inverse the Problem——最小生成树