Submission #1233343

#	Time	Username	Problem	Language	Result	Execution time	Memory
1233343		yixuan19	Team Coding (EGOI24_teamcoding)	C++20	12 / 100	31 ms	1352 KiB

Main

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main(){
    int N, K, lang, boss;
    cin >> N >> K;
    vector <int> languages (K+1, 0);
    vector <int> highest (K+1, 0);
    vector<int> up(N+1);
    for (int i = 0; i < N; ++i){
        cin >> lang;
        if (languages[lang] == 0) highest[lang] = i;
        languages[lang]++;
    }
    for (int i = 1; i <= N-1; ++i){
        cin >> boss;
        up[i] = boss;
    }
    int maxi = 0;
    int chosen = 0;
    for (int i = 0; i < K; ++i){
        if (languages[i] > maxi){
            maxi = languages[i];
            chosen = i;
        }
    }
    cout<<maxi<<' '<<0<<endl;
}

• Subtask 1: 12 / 12
• Subtask 2: 0 / 19
• Subtask 3: 0 / 27
• Subtask 4: 0 / 23
• Subtask 5: 0 / 19