#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
  
  int n , q; cin >> n >> q;
  vector <int> a(q); map <int , int> mp;
  for (int i = 0 ; i < q ; ++i){
      cin >> a[i];
      ++mp[a[i]];
  }
  
  ll ans = 0;
  for (int &u : a){
    ans = max(ans , mp[u] * 1LL);
  }
  
  cout << max(0LL ,ans - 1) << "\n";
  
  return 0;
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... |