Submission #1238934

#TimeUsernameProblemLanguageResultExecution timeMemory
1238934samiaTeam Coding (EGOI24_teamcoding)C++20
12 / 100
45 ms4936 KiB
#include <bits/stdc++.h>
#include <iostream>
#include <cmath>
using namespace std;

int main() {

  int n,k;
  cin>>n>>k;
  map<int,int>m;
  int r=0;
  for(int so=0;so<n;so++){
      cin>>r;
      m[r]+=1;
  }
  int ans=0;
    for(int so=0;so<k;so++){
    ans=max(ans,m[so]);
  }
  cout<<ans<<" "<<"0"<<endl;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...