229142026-01-16 08:42:41PKARadar (70 pont)cpp17Accepted 70/7096ms1256 KiB
#include <iostream>
#include<vector>
using namespace std;

int main()
{
    int maxenemyindex = 0;
    int maxenemy = 0;
    int N;
    int M;
    cin >> N;
    cin >> M;
    vector<int>sajat(N);
    vector<int>ellenseg(M);
    for(int i = 0; i< N; i++){
        cin >> sajat[i];
    }
    for(int i = 0; i< M; i++){
        cin >> ellenseg[i];
        if(ellenseg[i] >= maxenemy){
            maxenemy = ellenseg[i];
            maxenemyindex = i;
        }
    }
    for(int i = 0; i < N; i++){
        if(sajat[i] <= maxenemy){
            cout<<"NEM"<<endl;
            cout << i+1 <<endl;
            cout << maxenemyindex+1;
            return 0;
        }
    }
    cout <<"IGEN";
}
SubtaskSumTestVerdictTimeMemory
base70/70
1Accepted0/01ms500 KiB
2Accepted0/01ms316 KiB
3Accepted5/51ms316 KiB
4Accepted5/51ms316 KiB
5Accepted5/51ms316 KiB
6Accepted5/51ms316 KiB
7Accepted5/51ms316 KiB
8Accepted5/51ms316 KiB
9Accepted5/52ms316 KiB
10Accepted5/535ms1196 KiB
11Accepted5/535ms1196 KiB
12Accepted5/552ms1004 KiB
13Accepted5/552ms844 KiB
14Accepted5/596ms1076 KiB
15Accepted5/594ms1256 KiB
16Accepted5/593ms1192 KiB