[ 프로그래머스 1 단계 ] 완주하지 못한 선수

#include <string>
#include <vector>
#include <algorithm>
#include <iostream>
#include <set>
 
using namespace std;
 
string solution(vector<string> participant, vector<string> completion) {
    string answer = "";
    set<string> name;
    
    for(int i = 0; i < participant.size(); i++)
    {
        auto it = find(completion.begin(), completion.end(), participant[i]);
        if (it == completion.end())
        {
            answer = participant[i];
            return answer;
        }
        
        if(name.find(participant[i]) != name.end())
        {
            answer = participant[i];
            return answer;
        }
        
        name.insert(participant[i]);
    }
    return answer;
}

푸는중..