Level 2. 추억 점수

Level 2. 추억 점수

 

 

그냥 이중 for문을 쓸 걸 그랬다.

 

#include <iostream>
#include <vector>
#include <unordered_map>
#include <algorithm>
#include <numeric>

using namespace std;

vector<int> solution(vector<string> name, vector<int> yearning, vector<vector<string>> photo)
{
    vector<int> answer(photo.size());
    size_t size = name.size();
    unordered_map<string, int> umap;

    for (int i = 0; i < size; ++i)
        umap[name[i]] = yearning[i];

    auto func  = [&umap](int sum, string& s){ return sum + umap[s]; };
    auto func2 = [&func](vector<string>& v) { return accumulate(v.begin(), v.end(), 0, func); };
    transform(photo.begin(), photo.end(), answer.begin(), func2);

    return answer;
}