Element Appearing More Than 25% In Sorted Array LeetCode solution in C++

1
class Solution {
2
 public:
3
  int findSpecialInteger(vector<int> &arr) {
4
    int freq = 0.25 * arr.size();
5
    map<int, int> m;
6
    for (int i : arr) m[i]++;
7

8
    int k;
9
    for (auto i : m) {
10
      if (i.second > freq) {
11
        k = i.first;
12
        break;
13
      }
14
    }
15
    return k;
16
  }
17
};