문제 링크 - https://programmers.co.kr/learn/courses/30/lessons/42576
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
string solution(vector<string> participant, vector<string> completion) {
string answer = "";
sort(participant.begin(), participant.end());
sort(completion.begin(), completion.end());
for(int i=0; i<participant.size(); i++){
if(participant[i]!=completion[i]){
answer=participant[i];
break;
}
}
return answer;
}
#include <string>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;
map<string, int> m;
string solution(vector<string> participant, vector<string> completion) {
string answer = "";
for(auto i: participant){
m[i]++;
}
for( auto i:completion){
m[i]--;
}
for(auto i:participant){
if(m[i]!=0){
answer=i;
break;
}
}
return answer;
}