Why20 Pts

#include <bits/stdc++.h>
using namespace std;
int q[150000];
int head=0;//Included Add Each Time
int tail=0;//Excluded
int main(){
    int n,m;
    int ans=0;
    cin >> m >> n;
    for (int i=1; i<=n; i++){
        int p;
        cin >> p;
        int flag=0;
        for (int i=tail+1; i<=head; i++){
            if (q[i]==p){
                flag=1;
                break;
            }
        }
        if (flag==1) continue;
        //None
        ans++;
        head++;
        q[i]=p;
        if (head-tail>m) tail++;
    }
    cout << ans;
}