CodeForces 469A. I Wanna Be the Guy set简单应用

set 去重

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <vector>
#include <set>
#include <stack>
#include <map>
#include <climits>

using namespace std;

typedef long long ll;
const int maxn = 10000 + 7, INF = 0x3f3f3f3f, mod = 1e9 + 7;

int m, n1, n2, a;
set<int> st;

int main() {
    scanf("%d", &m);
    scanf("%d", &n1);
    for(int i = 0; i < n1; ++i) { scanf("%d", &a); st.insert(a); }
    scanf("%d", &n2);
    for(int i = 0; i < n2; ++i) { scanf("%d", &a); st.insert(a); }

    if((int)st.size() == m) return 0*puts("I become the guy.");
    else return 0*puts("Oh, my keyboard!");

    return 0;
}