Submission #1355383

#TimeUsernameProblemLanguageResultExecution timeMemory
1355383mxhrvsTeam Coding (EGOI24_teamcoding)C++20
12 / 100
27 ms800 KiB
#include<bits/stdc++.h>
using namespace std;

const int maxn = (int)2e5 + 5;
int cnt[maxn];

signed main(){
    int n, k;
    cin >> n >> k;
    
    int a;
    for(int i = 0; i < n; i ++){
        cin >> a;
        cnt[a]++;
    }
    
    for(int i = 0; i < n - 1; i ++){
        cin >> a;
    }
    
    int mx = 0;
    for(int i = 0; i < k; i ++){
        mx = max(cnt[i], mx);
    }
    
    cout << mx << " 0\n";
    
    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...