Submission #1148317

#TimeUsernameProblemLanguageResultExecution timeMemory
1148317MuhammadSaramTeam Coding (EGOI24_teamcoding)C++20
12 / 100
33 ms3656 KiB
#include <bits/stdc++.h>

using namespace std;

int main()
{
	int n,k;
	cin>>n>>k;
	int a[n];
	for (int i=0;i<n;i++)
		cin>>a[i];
	map<int,int> cnt;
	int ans=0;
	for (int i=n-1;i>=0;i--)
		ans=max(ans,++cnt[a[i]]);
	cout<<ans<<' '<<0<<endl;
	
	return 0;
}
#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...