赞
踩
You are given an array aa consisting of nn integers. Each aiai 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 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,42.
Examples of good arrays:
Examples of bad arrays:
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,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
【题解】
找到有几组4,8,15,16,23,42就可以了 然后总数减去组数*6;
- #include <bits/stdc++.h>
- using namespace std;
- const int maxn=1e5+10;
- int main()
- {
- int n;
- scanf("%d",&n);
- vector<int>a(n);
- for(int i=0;i<n;i++)
- {
- int v;
- scanf("%d",&v);
- if(v==4)a[i]=1;
- if(v==8)a[i]=2;
- if(v==15)a[i]=3;
- if(v==16)a[i]=4;
- if(v==23)a[i]=5;
- if(v==42)a[i]=6;
- }
- vector<int>cur(7);
- cur[0]=n;
- for(int i=0;i<n;i++)
- {
- if(cur[a[i]-1]>0)
- {
- ++cur[a[i]];
- --cur[a[i]-1];
- }
- }
- int ans=n-6*cur[6];
- printf("%d",ans);
- return 0;
- }
Copyright © 2003-2013 www.wpsshop.cn 版权所有,并保留所有权利。