-
Notifications
You must be signed in to change notification settings - Fork 55
/
Copy path158B. Taxi.cpp
67 lines (60 loc) · 1.27 KB
/
158B. Taxi.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
//============================================================================
//problem link:http://codeforces.com/problemset/problem/158/B
// Name : .cpp
// Author : mohand sakr
// Version :
// Copyright : use it under your responsibility
// Description : Hello World in C++, Ansi-style
//status:accepted
//============================================================================
#include <iostream>
#include<algorithm>
using namespace std;
int main() {
int n;
cin>>n;
int taxicount=0;
int arr[5]={0,0,0,0,0};
for(int i=0;i<n;i++){
int a;
cin>>a;
++arr[a];
}
taxicount+=arr[4];
arr[4]=0;
if(arr[2]){
int t=arr[2]>>1;
taxicount+=t;
arr[2]-=t*2;
}
if(arr[1]&&arr[3]){
int mnivalue=min(arr[1],arr[3]);
taxicount+=mnivalue;
arr[1]-=mnivalue;
arr[3]-=mnivalue;
}
if(arr[1]&&arr[2]){
if(arr[2]<=arr[1]>>1&&arr[1]>>1){
taxicount+=arr[2];
arr[1]-=arr[2]*2;
arr[2]-=arr[2];
}
else{
int z=min(arr[1],arr[2]);
taxicount+=z;
arr[1]-=z;
arr[2]-=z;
}
}
int y=arr[1]/4;
taxicount+=y;
arr[1]-=y*4;
if(arr[1]<4&&arr[1]){
taxicount+=1;
arr[1]=0;
}
for(int i=1;i<5;i++){
taxicount+=arr[i];}
cout<<taxicount;
return 0;
}