126032024-12-26 17:24:37PappMatyasRadar (70 pont)cpp17Accepted 70/7093ms2308 KiB
#include <iostream>

using namespace std;

int main()
{
    int n, m, maxi, mini, k, minsave = 1, maxsave = 1;
    cin >> n >> m;
    cin >> k;
    mini = k;
    for(int i = 1; i < n; i++)
    {
        cin >> k;
        if(mini > k)
        {
            mini = k;
            minsave = i + 1;
        }
    }
    cin >> k;
    maxi = k;
    for(int i = 1; i < m; i++)
    {
        cin >> k;
        if(maxi < k)
        {
            maxi = k;
            maxsave = i + 1;
        }
    }
    if(mini > maxi)
    {
        cout << "IGEN";
    }
    else
    {
        cout << "NEM" << endl << minsave << endl << maxsave;
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base70/70
1Accepted0/01ms320 KiB
2Accepted0/01ms320 KiB
3Accepted5/51ms320 KiB
4Accepted5/51ms320 KiB
5Accepted5/51ms320 KiB
6Accepted5/51ms320 KiB
7Accepted5/51ms592 KiB
8Accepted5/51ms320 KiB
9Accepted5/51ms320 KiB
10Accepted5/535ms644 KiB
11Accepted5/535ms648 KiB
12Accepted5/552ms1328 KiB
13Accepted5/554ms1292 KiB
14Accepted5/592ms2176 KiB
15Accepted5/592ms2104 KiB
16Accepted5/593ms2308 KiB