代码
#include <cstdio>
#include <iostream>
#include <cstring>
#include <queue>
#include <set>
using namespace std;
queue<int> Q;
multiset<int> S;
int m,n,num,ans(0);
int main() {
scanf("%d%d",&m,&n);
for(int i=1;i<=n;i++){
scanf("%d",&num);
if(!S.count(num)){
Q.push(num);
S.insert(num);
ans++;
if(Q.size()>m){
S.erase(Q.front());
Q.pop();
}
}
}
cout<<ans<<endl;
return 0;
}