Submission #1148487

#TimeUsernameProblemLanguageResultExecution timeMemory
1148487SyedSohaib_123Team Coding (EGOI24_teamcoding)C++20
12 / 100
33 ms4312 KiB
#include <bits/stdc++.h> using namespace std; #define append push_back #define int long long const int N=4e5+10,LG=21; int mod=998244353; void solve(int tst){ int n,k; cin>>n>>k; map<int,int>f; int ans=0; for(int i=1;i<=n;i++){ int a; cin>>a; f[a]++; ans=max(ans,f[a]); } cout<<ans<<' '<<0<<endl; } signed main(){ ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); int t = 1; // cin >> t; for(int i=1;i<=t;i++) solve(i); }
#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...