leetcode 1131 获取你好友已观看的视频

class Solution {
public:
    vector<string> watchedVideosByFriends(vector<vector<string>>& watchedVideos, vector<vector<int>>& friends, int id, int level) {
        vector<bool> vis(friends.size(),false);
        map<string,int> m;
        vector<string> res;
        int floor=0;
        queue<int> q;
        q.push(id);
        vis[id]=true;
        while(!q.empty()){
            if(floor==level){
                while(!q.empty()){
                    int cur = q.front();
                    q.pop();
                    for(int i=0;i<watchedVideos[cur].size();i++){
                        if(!m[watchedVideos[cur][i]])
                            m[watchedVideos[cur][i]]=1;
                        else
                            m[watchedVideos[cur][i]]++;
                    }  
                }
                break;
            }
            
            int size = q.size();
            for(int j=0;j<size;j++){
                id = q.front();q.pop();
                for(int i=0;i<friends[id].size();i++){
                    if(!vis[friends[id][i]]){
                        q.push(friends[id][i]);
                        vis[friends[id][i]]=true;                 
                    }
                }
            }
            floor++;
        }
        
        vector<pair<string, int>> vec(m.begin(),m.end());
        sort(vec.begin(), vec.end(), cmp);
        map<string, int>::iterator it;
        
        for (int i = 0; i < vec.size(); ++i){
	        res.push_back(vec[i].first);
	    }
        return res;
    }
    static bool cmp(const pair<string, int>& a, const pair<string, int>& b) {
	        return a.second < b.second||(a.second==b.second && a.first < b.first);
    }
};