class Solution {

public:
int findJudge(int n, vector<vector<int>>& trust) {
vector<int> a(n, 0);
vector<int> b(n, 0);

for(auto& a_b: trust) {
a[a_b[0]-1]++;
b[a_b[1]-1]++;
}
for(int i = 0; i < n; i++) {
if(b[i] == n-1 && !a[i]){
return i+1;
}
}
return -1;
}

};

이벤트 참가 ㅇㅅㅇ