class Solution {
public:
int findJudge(int n, vector<vector<int>>& trust) {
vector<int> in(n+1,0);
vector<int> out(n+1,0);
for(auto x:trust)
{
int a=x[0],b=x[1];
in[b]++;
out[a]++;
}
for(int i=1;i<=n;i++)
{
if(in[i]==n-1 && out[i]==0) return i;
}
return -1;
}
};