[알고리즘] 백준 27160 - 할리갈리 (C++)

[문제 링크] : https://www.acmicpc.net/problem/27160

#include <iostream>
#include <map>
using namespace std;

int main(){
    int N, inp;
    string S;
    map<string, int> M;
    
    cin >> N;
    for(int i=0; i<N; i++){
        cin >> S >> inp;
        M[S] += inp;
    }

    bool flag = false;

    if(M["STRAWBERRY"] == 5){
        flag = true;
    }
    else if(M["BANANA"] == 5){
        flag = true;
    }
    else if(M["LIME"] ==5){
        flag = true;
    }
    else if(M["PLUM"] == 5){
        flag = true;
    }

    cout << (flag ? "YES" : "NO") << "\n";
    return 0;
}