国内最全IT社区平台 联系我们 | 收藏本站
华晨云阿里云优惠2
您当前位置:首页 > php开源 > php教程 > 158B - Taxi

158B - Taxi

来源:程序员人生   发布时间:2014-12-24 08:47:22 阅读次数:2931次
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.

Sample test(s)
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.

import java.util.*; public class Main { public static void main(String[] args) { Scanner sc=new Scanner(System.in); int n=sc.nextInt(); int n1=0,n2=0,n3=0,count=0; for(int i=0;i<n;i++) { int x=sc.nextInt(); if(x==1) n1++; if(x==2) n2++; if(x==3) n3++; if(x==4) count++; } if(n3>=n1) {count+=n3;count+=(n2+1)/2;} else { count+=n3+n2/2;n1-=n3; if(n2%2==0&&n1>0) count+=(n1⑴)/4+1; else count+=(n1+1)/4+1; } System.out.println(count); } }


生活不易,码农辛苦
如果您觉得本网站对您的学习有所帮助,可以手机扫描二维码进行捐赠
程序员人生
------分隔线----------------------------
分享到:
------分隔线----------------------------
关闭
程序员人生