ZCMU暑期训练四-J - Lose it!

You are given an array aa consisting of nn integers. Each aiai is one of the six following numbers: 4,8,15,16,23,424,8,15,16,23,42.

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

An array of length kk is called good if kk is divisible by 66 and it is possible to split it into k6k6 subsequences 4,8,15,16,23,424,8,15,16,23,42.

Examples of good arrays:

[4,8,15,16,23,42][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][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][4,8,15,16,42,23] (the order of elements should be exactly 4,8,15,16,23,424,8,15,16,23,42);
[4,8,15,16,23,42,4][4,8,15,16,23,42,4] (the length of the array is not divisible by 66);
[4,8,15,16,23,42,4,8,15,16,23,23][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 nn (1≤n≤5⋅1051≤n≤5⋅105) — the number of elements in aa.

The second line of the input contains nn integers a1,a2,…,ana1,a2,…,an (each aiai is one of the following numbers: 4,8,15,16,23,424,8,15,16,23,42), where aiai is the ii-th element of aa.

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

Examples
Input
5
4 8 15 16 23
Output
5
Input
12
4 8 4 15 16 8 23 15 16 42 23 42
Output
0
Input
15
4 8 4 8 15 16 8 16 23 15 16 4 42 23 42
Output
3

题面：必须按照题面给的顺序然后 样例也有不多解释；

思路：变输入边做 别看数据不大 题目简单操作起来简单 但是容易T因为 算复杂度的时候发现每个枚举 在最差的情况是O（n^2）;
所以换个操作删去不必要的步骤就可以了；

#include<iostream>
#include<map>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<cstdio>
#include<vector>
using namespace std;
#pragma warning (disable:4786)
const int maxn=5e5+5;
int nuk[]={4,8,15,16,23,42};
int a[maxn];
vector<int>num(7);
int main()
{	num[0]=maxn;
	int count=0,flag=0;
	for(int i=0;i<maxn;i++)a[i]=0;
	int k,ans=0;
	scanf("%d",&k);
	
	for(int i=0;i<k;i++)
	{
		int temp;
		scanf("%d",&temp);
		if(temp==4)temp=1;
		if(temp==8)temp=2;
		if(temp==15)temp=3;
		if(temp==16)temp=4;
		if(temp==23)temp=5;
		if(temp==42)temp=6;
		
		if(num[temp-1]!=0)
		{
			num[temp-1]--;
			num[temp]++;
		}	
	}
	ans=num[6];
	cout<<k-ans*6<<endl;
}