Submission #1193925

#TimeUsernameProblemLanguageResultExecution timeMemory
1193925veehjTeam Coding (EGOI24_teamcoding)C++20
12 / 100
55 ms4168 KiB
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define pb push_back
#define sz(a) (ll) a.size()
#define all(x) (x).begin(), (x).end()
#define rep(i, a, b) for(ll i=a; i<b; i++)
#define rrep(i, a, b) for(ll i=a; i>=b; i--)
#define vl vector<ll>
#define vpll vector<pair<ll, ll>>
#define vvl vector<vector<ll>>
#define pll pair<ll, ll>`

void f() {
  ll n, k; cin >> n >> k;
  map<ll, ll> mp;
  ll ans=0;
  for(int i=0; i<n; i++){
    ll x; cin >> x;
    mp[x]++;
    ans=max(ans, mp[x]);
  }
  cout << ans << ' ' << 0;
}

int main() {
  int tc = 1;
  // cin >> tc;
  for (int i = 1; i <= tc; i++) {
    // cout << '#' << i << endl;
    f();
    cout << 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...