198592025-12-27 11:04:47GergoszaboRadar (70 pont)cpp17Wrong answer 40/7093ms3756 KiB
#include <iostream>
#include <bits/stdc++.h>
using ll = long long;
using namespace std;

int main()
{
    ll n, m; cin >> n >> m;
    vector<ll> me(n+1), opp(m+1);
    ll mmin = 10000000000, mind = -1, omax = 0, oind = -1;
    for (ll i = 1; i <= n; i++){
        cin >> me[i];
        if (mmin > me[i]){
            mmin = me[i]; mind = i;
        }
    }
    for (ll i = 1; i <= m; i++){
        cin >> opp[i];
        if (omax < opp[i]){
            omax = opp[i]; oind = i;
        }
    }
    if (mmin > omax){
        cout << "IGEN";
    }
    else {
        cout << "NEM" << "\n";
        cout << mind << "\n";
        cout << omax;
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base40/70
1Accepted0/01ms500 KiB
2Accepted0/01ms508 KiB
3Accepted5/51ms316 KiB
4Accepted5/51ms316 KiB
5Accepted5/51ms508 KiB
6Accepted5/52ms316 KiB
7Accepted5/52ms316 KiB
8Wrong answer0/52ms500 KiB
9Accepted5/51ms316 KiB
10Accepted5/535ms2208 KiB
11Accepted5/537ms2080 KiB
12Wrong answer0/552ms2228 KiB
13Wrong answer0/552ms2156 KiB
14Wrong answer0/593ms3636 KiB
15Wrong answer0/593ms3756 KiB
16Wrong answer0/593ms3732 KiB