#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 2e5+10;
priority_queue <ll> q;
struct node{
	ll l,d;
}quan[N]; 

bool cmp(node x,node y){
	return x.l<y.l;
} 

ll n,a[N],ans;

int main(){
	scanf("%lld%lld",&n,&n);
	for(int i=1;i<=n;i++){
		scanf("%lld",&quan[i].l);
		a[i]=quan[i].l;
	}
	for(int i=1;i<=n;i++){
//		scanf("%lld",&quan[i].d);
		quan[i].d=1;
	}
	sort(a+1,a+1+n);
	sort(quan+1,quan+1+n,cmp);
	int j=1;
	for(int i=1;i<=n;i++){
		while(j<=n&&quan[j].l<=a[i]){
			q.push(quan[j].d);
			j++;
		}
		ans++;
		if(q.size()){
			ans-=q.top();
			q.pop();
		} 
	}
	printf("%lld",ans);
	return 0;
}