225932026-01-15 11:43:51PKBRadar (70 pont)cpp17Wrong answer 65/7093ms1984 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
base65/70
1Accepted0/01ms316 KiB
2Accepted0/01ms316 KiB
3Accepted5/51ms316 KiB
4Accepted5/51ms316 KiB
5Accepted5/51ms400 KiB
6Accepted5/51ms316 KiB
7Accepted5/51ms316 KiB
8Accepted5/51ms408 KiB
9Accepted5/51ms316 KiB
10Accepted5/537ms1976 KiB
11Wrong answer0/535ms1844 KiB
12Accepted5/552ms1084 KiB
13Accepted5/552ms1268 KiB
14Accepted5/593ms1844 KiB
15Accepted5/593ms1984 KiB
16Accepted5/593ms1984 KiB