suprisingly annoying
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```rust []\n\nuse std::collections::HashMap;\n\nimpl Solution {\n  pub fn winning_player_count(n: i32, pick: Vec<Vec<i32>>) -> i32 {\n    let mut res = 0;\n    let mut hm:HashMap<i32, HashMap<i32,i32>> = HashMap::new();\n    for p in pick {\n      let mut player_balls = hm.entry(p[0]).or_insert(HashMap::new());\n      *player_balls.entry(p[1]).or_insert(0)+=1;\n    }\n    for (k,freqs) in hm {\n      for (_,freq) in freqs {\n        if freq >= (k+1) { \n            res+=1;\n            break\n        }\n      }\n    }\n    res\n  }\n}\n\n```
['Rust']