# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1148176 | Faisal_Saqib | Infinite Race (EGOI24_infiniterace2) | C++20 | 92 ms | 9800 KiB |
#include <iostream>
#include <map>
using namespace std;
int main()
{
int n,q;
cin>>n>>q;
map<int,int> cnt;
int mx=1;
while(q--)
{
int x;
cin>>x;
cnt[x]++;
mx=max(mx,cnt[x]);
}
cout<<mx-1<<endl;
}
# | 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... |