#include <iostream> #include <vector> #include <unordered_set> using namespace std; int main() { int M, N; cin >> M >> N; vector<int> article(N); for (int i = 0; i < N; ++i) { cin >> article[i]; } unordered_set<int> memory; int dict_lookups = 0; for (int i = 0; i < N; ++i) { if (memory.size() < M) { if (memory.find(article[i]) == memory.end()) { memory.insert(article[i]); dict_lookups++; } } else { if (memory.find(article[i]) == memory.end()) { memory.erase(memory.begin()); memory.insert(article[i]); dict_lookups++; } } } cout << dict_lookups << endl; return 0; }