Codeforces(A - MP3)细节

One common way of digitalizing sound is to record sound intensity at particular time moments. For each time moment intensity is recorded as a non-negative integer. Thus we can represent a sound file as an array of n non-negative integers.

If there are exactly K distinct values in the array, then we need k=⌈log2K⌉ bits to store each value. It then takes nk bits to store the whole file.

To reduce the memory consumption we need to apply some compression. One common way is to reduce the number of possible intensity values. We choose two integers l≤r, and after that all intensity values are changed in the following way: if the intensity value is within the range [l;r], we don’t change it. If it is less than l, we change it to l; if it is greater than r, we change it to r. You can see that we lose some low and some high intensities.

Your task is to apply this compression in such a way that the file fits onto a disk of size I bytes, and the number of changed elements in the array is minimal possible.

We remind you that 1 byte contains 8 bits.

k=⌈log2K⌉ is the smallest integer such that K≤2k. In particular, if K=1, then k=0.

Input

The first line contains two integers n and I (1≤n≤4⋅105, 1≤I≤108) — the length of the array and the size of the disk in bytes, respectively.

The next line contains n integers ai (0≤ai≤109) — the array denoting the sound file.

Output

Print a single integer — the minimal possible number of changed elements.

Examples

input
6 1
2 1 2 3 4 3
output
2

input
6 2
2 1 2 3 4 3
output
0

input
6 1
1 1 2 2 3 3
output
2

Note

In the first example we can choose l=2,r=3. The array becomes 2 2 2 3 3 3, the number of distinct elements is K=2, and the sound file fits onto the disk. Only two values are changed.
In the second example the disk is larger, so the initial file fits it and no changes are required.
In the third example we have to change both 1s or both 3s.

div.1的A题，大佬们的热身小题儿，我的无限WA题。。。
这道题，很细节
首先要满足题目给的那个式子
求k使得 n * log2(k) <= I * 8
k就是a数组中不同数目的个数
可以进行一次操作，选定一个区间[l,r]使得数组中小于l的变成l，大于r的变成r
先给原数组排序
然后求出要改变的数的个数，数组从左边到右边滑一下，求出最小值
一开始是贪心做的，有些情况不能贪心的
建议使用scanf读入，否则容易在第13个点T掉
还有亲测这个题中unordered_map比map会快0.1秒左右。。。。

代码：

#include <bits/stdc++.h>
#define ll long long
using namespace std;

ll a[500000];
//unordered_map<ll,ll> Map;
map<ll,ll> Map;

ll d[400005],f[400005];
int main()
{
    ll n,m,k=0;
    scanf("%lld %lld",&n,&m);
    for(int i=0;i<n;i++)
    {
        scanf("%lld",&a[i]);
        if(Map[a[i]]==0)
        {Map[a[i]]++;k++;}
        else
        {Map[a[i]]++;}
    }
    ll op=(m*8)/n;
    ll uu;
    for(int i=400001;i>=1;i--)
    {
        if(log2(i)<=op)
        {uu=i;break;}
    }
    sort(a,a+n);
    ll cxk=k-uu;
    if(cxk<=0)
    {printf("0\n");return 0;}
    int i=0,j=n-1,e=0;
    ll maxx=0;
    while(i<n)
    {
        if(e==cxk)
        {break;}
        d[e]=Map[a[i]];maxx+=d[e];
        i+=Map[a[i]];
        e++;
    }
    e=0;
    while(j>=0)
    {
        if(e==cxk)
        {break;}
        f[e]=Map[a[j]];
        j-=Map[a[j]];
        e++;
    }
    ll ans=maxx;
    ll lpl=maxx;
    j=0;
    for(int i=cxk-1;i>=0;i--)
    {
        lpl=lpl-d[i]+f[j];
        ans=min(ans,lpl);
        j++;
    }
    cout<<ans<<endl;
    return 0;
}