Data Structure Array: Given an array of of size n and a number k, find all elements that appear more than n/k times

http://www.geeksforgeeks.org/given-an-array-of-of-size-n-finds-all-the-elements-that-appear-more-than-nk-times/

这一题如果没空间要求就没那么麻烦了

 #include <iostream>
 #include <vector>
 #include <algorithm>
 #include <queue>
 #include <stack>
 #include <string>
 #include <fstream>
 #include <map>
 using namespace std;

 void more(int arr[], int n, int k) {
     map<int, int> S;
     for (int i = ; i < n; i++) {
         if (S.find(arr[i]) != S.end()) S[arr[i]]++;
         else if (S.size() == k) {
             for (map<int, int>::iterator it = S.begin(); it != S.end(); it++) {
                 if (it->second == ) S.erase(it->first);
                 else it->second--;
             }
         }
         else S[arr[i]] = ;
     }
     for (map<int, int>::iterator it = S.begin(); it != S.end(); it++) {
         int tmp = ;
         for (int i = ; i < n; i++) {
             if (arr[i] == it->first) tmp++;
         }
         if (tmp > n / k) cout << it->first << " ";
     }
 }

 int main() {
     int arr[] = {, , , , , , };
     more(arr, , );
     return ;
 }