Codeforces Round #565 (Div. 3) C. Lose it!

You are given an array a consisting of n integers. Each ai is one of the six following numbers: 4,8,15,16,23,42.

Your task is to remove the minimum number of elements to make this array good.

An array of length k is called good if k is divisible by 6 and it is possible to split it into k6 subsequences 4,8,15,16,23,42.

Examples of good arrays:

[4,8,15,16,23,42] (the whole array is a required sequence);
[4,8,4,15,16,8,23,15,16,42,23,42] (the first sequence is formed from first, second, fourth, fifth, seventh and tenth elements and the second one is formed from remaining elements);
[] (the empty array is good).
Examples of bad arrays:

[4,8,15,16,42,23] (the order of elements should be exactly 4,8,15,16,23,42);
[4,8,15,16,23,42,4] (the length of the array is not divisible by 6);
[4,8,15,16,23,42,4,8,15,16,23,23] (the first sequence can be formed from first six elements but the remaining array cannot form the required sequence).
Input
The first line of the input contains one integer n (1≤n≤5⋅105) — the number of elements in a.

The second line of the input contains n integers a1,a2,…,an (each ai is one of the following numbers: 4,8,15,16,23,42), where ai is the i-th element of a.

Output
Print one integer — the minimum number of elements you have to remove to obtain a good array.

Examples
inputCopy
5
4 8 15 16 23
outputCopy
5
inputCopy
12
4 8 4 15 16 8 23 15 16 42 23 42
outputCopy
0
inputCopy
15
4 8 4 8 15 16 8 16 23 15 16 4 42 23 42
outputCopy
3

贪心

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<cstdlib>
#include<set>
#include<queue>
#include<stack>
#define PI acos(-1)
#define ll long long
using namespace std;
int n, a[500005], ans = 0;
int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> n;
	int s1 = 0, s2 = 0, s3 = 0, s4 = 0, s5 = 0, s6 = 0;
	for (int i = 0; i < n; i++) {
		cin >> a[i];
		if (a[i] == 4)s1++;
		if (a[i] == 8&&s2<s1)s2++;
		if (a[i] == 15&&s3<s2)s3++;
		if (a[i] == 16&&s4<s3)s4++;
		if (a[i] == 23&&s5<s4)s5++;
		if (a[i] == 42&&s6<s5)s6++;
	}
	cout << n - s6 * 6 << endl;
	//system("pause");
	return 0;
}