-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path158B-Taxi.cpp
74 lines (63 loc) · 1.36 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
68
69
70
71
72
73
74
#include <bits/stdc++.h>
using namespace std;
int main(){
// decleration and inputting
int count1 = 0;
int count2 = 0;
int count3 = 0;
int count4 = 0;
int minTaxi = 0;
int n{0};
cin >>n;
int s[n];
for(int i= 0; i<n; i++){
cin>> s[i];
}
// main algorithm
for(int i = 0; i<n; i++){ // classifiying the groups
if(s[i] == 1){
count1++;
}
else if(s[i] == 2){
count2++;
}
else if(s[i] == 3){
count3++;
}
else if(s[i] == 4){
count4++;
}
else{}
}
minTaxi = count4;
while(count1 !=0 && count3 != 0){
count3 = count3-1;
count1 = count1-1;
minTaxi++;
}
if(count1 == 0 && count3 != 0){
minTaxi = minTaxi+count3;
count3 = 0;
}
minTaxi = minTaxi+ count2 /2;
if(count2%2 != 0){
if(count1<=2){
minTaxi++;
count2 = 0;
count1 = 0;
}
else{
count1 = count1-2;
minTaxi++;
count2 = 0;
}
}
if(count1 != 0){
minTaxi = minTaxi+count1/4;
if(count1%4 != 0){
minTaxi++;
}
}
cout << minTaxi << endl;
return 0;
}