제출 #1221517

#제출 시각아이디문제언어결과실행 시간메모리
1221517gry3125Team Coding (EGOI24_teamcoding)C++20
12 / 100
60 ms4168 KiB
#include <bits/stdc++.h>
#define f0r(i,n) for(int i=0;i<n;i++)
typedef long long int ll; 
using namespace std;

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