Tetris

Tetris

题目

You are given a following process.
There is a platform with n
columns. 1×1
squares are appearing one after another in some columns on this platform. If there are no squares in the column, a square will occupy the bottom row. Otherwise a square will appear at the top of the highest square of this column.
When all of the n columns have at least one square in them, the bottom row is being removed. You will receive 1 point for this, and all the squares left will fall down one row.
You task is to calculate the amount of points you will receive.

Input

The first line of input contain 2 integer numbers n and m (1≤n,m≤1000) — the length of the platform and the number of the squares.
The next line contain m integer numbers c1,c2,…,cm (1≤ci≤n) — column in which i-th square will appear.

Output

Print one integer — the amount of points you will receive.

Example

input

3 9
1 1 2 2 2 3 1 2 3

output

2

思路

把输入的1、2、3…看做数组下标，往1位置放小方格，就在数组下标为1的元素里加1。因为目标是像俄罗斯方块一样消掉最底部放满三个位置的一排，因此比较每一列方格的数量，最小的方格数就是可以消掉的排数。

代码

#include <bits/stdc++.h>
using namespace std;
const int maxn=1005;
const int Max=0x3f3f3f3f;

int main()
{
    int n,m;
    cin>>n >>m;
    int a[maxn],temp;
    int ref=Max;
    memset(a,0,sizeof(a));
    for(int i=0;i<m;i++)
    {
        cin>>temp;
        a[temp]++;
    }
    for(int i=1;i<=n;i++)
    {
        ref=min(ref,a[i]);
    }
    cout<<ref<<endl;
}