229522026-01-16 09:30:25PKBProgramtermék verseny (70 pont)cpp17Wrong answer 0/7037ms1668 KiB
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
    long long N, M;
    cin >> N >> M;

    vector<long long> ownRadars(N);
    vector<long long> enemyRadars(M);

    for (long long i = 0; i < N; ++i) {
        cin >> ownRadars[i];
    }

    for (long long i = 0; i < M; ++i) {
        cin >> enemyRadars[i];
    }


    long long maxEnemyRadar = *max_element(enemyRadars.begin(), enemyRadars.end());

    for (long long i = 0; i < N; ++i) {
        if (ownRadars[i] <= maxEnemyRadar) {
            cout << "NEM\n";

            for (long long j = 0; j < M; ++j) {
                if (ownRadars[i] <= enemyRadars[j]) {
                    cout << i + 1 << "\n" << j + 1;
                    return 0;
                }
            }
        }
    }

    cout << "IGEN\n";
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base0/70
1Wrong answer0/01ms316 KiB
2Wrong answer0/01ms316 KiB
3Wrong answer0/037ms1076 KiB
4Wrong answer0/31ms336 KiB
5Wrong answer0/31ms316 KiB
6Wrong answer0/31ms316 KiB
7Wrong answer0/31ms316 KiB
8Wrong answer0/31ms316 KiB
9Wrong answer0/31ms316 KiB
10Wrong answer0/31ms408 KiB
11Wrong answer0/31ms316 KiB
12Wrong answer0/31ms508 KiB
13Wrong answer0/32ms368 KiB
14Wrong answer0/42ms452 KiB
15Wrong answer0/418ms916 KiB
16Wrong answer0/421ms1160 KiB
17Wrong answer0/427ms1184 KiB
18Wrong answer0/44ms560 KiB
19Wrong answer0/48ms564 KiB
20Wrong answer0/412ms644 KiB
21Wrong answer0/437ms1588 KiB
22Wrong answer0/437ms1668 KiB
23Wrong answer0/432ms1484 KiB