[CF从零单排#17]158B - Taxi

标签：school   contest   pac   i++   test   into   return   size   number   

题目来源：http://codeforces.com/contest/158/problem/B

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)?

Input
The first line contains integer n (1?≤?n?≤?105) — 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.

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.

题目大意：

乘坐taxi，每组人必须在同一辆车，一辆车最多坐4个人。每组人数只能是1，2，3，4个人。问最少需要多少辆车。

题目分析：

思维题。4人组和3人组必须要单独1辆车，2人组可以拼车，1人组凑到3人组和2人组剩余的车辆中去，如果还有剩余，4组组队。细节比较多，注意数组要重置。

#include <bits/stdc++.h>
using namespace std;
int main(){
	int a[5], n, x, ans = 0;
	cin >> n;
	memset(a, 0, sizeof(a));
	for(int i=1; i<=n; i++){
		cin >> x;
		a[x] ++;
	}
	ans += a[4];
	ans += a[3];
	ans += a[2]/2;
	a[1] -= a[3];
	if(a[2]%2){
		a[1] -= 2;
		ans ++;
	}
	if(a[1]<0)
		a[1] = 0;
	ans += a[1]/4;
	if(a[1]%4)
		ans ++;
	cout << ans;
	return 0;
} 

[CF从零单排#17]158B - Taxi

标签：school   contest   pac   i++   test   into   return   size   number   

原文地址：https://www.cnblogs.com/gdgzliu/p/13384593.html