CF 1176C贪心

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<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=5e5+7;
int s[maxn],n,m;
queue<int>a,b,c,d,e,f;
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin>>n;
	for(int i=0;i<n;++i){
		cin>>m;
		if(m==4)a.push(i);
		if(m==8)b.push(i);
		if(m==15)c.push(i);
		if(m==16)d.push(i);
		if(m==23)e.push(i);
		if(m==42)f.push(i);
	}
	int ans=0;
	while(1){
		while(b.front()<a.front()&&!b.empty())b.pop();
		if(b.empty())break;
		while(c.front()<b.front()&&!c.empty())c.pop();
		if(c.empty())break;
		while(d.front()<c.front()&&!d.empty())d.pop();
		if(d.empty())break;
		while(e.front()<d.front()&&!e.empty())e.pop();
		if(e.empty())break;
		while(f.front()<e.front()&&!f.empty())f.pop();
		if(f.empty())break;
		++ans;
		a.pop(),b.pop(),c.pop(),d.pop(),e.pop(),f.pop();
	}
	cout<<n-6*ans;
	return 0;
}