[프로그래머스] 커피 심부름

 

 

• 풀이

#include <string>
#include <vector>

using namespace std;

int solution(vector<string> order) {
    int answer = 0;
    for(int i=0; i< order.size(); i++){
        if(order[i].find("americano") != string::npos) answer += 4500;
        else if(order[i].find("cafelatte")!= string::npos) answer += 5000;
        else answer += 4500;
    }
    return answer;
}