Data Structure Array: Given an array of of size n and a number k, find all elements that appear more than n/k 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 = 0; 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 == 1) S.erase(it->first);
else it->second--;
}
}
else S[arr[i]] = 1;
}
for (map<int, int>::iterator it = S.begin(); it != S.end(); it++) {
int tmp = 0;
for (int i = 0; i < n; i++) {
if (arr[i] == it->first) tmp++;
}
if (tmp > n / k) cout << it->first << " ";
}
}

int main() {
int arr[7] = {4, 5, 6, 7, 8, 4, 4};
more(arr, 7, 3);
return 0;
}