Pagini recente » Cod sursa (job #429398) | Cod sursa (job #2931388) | Cod sursa (job #2732962) | Cod sursa (job #2822361) | Cod sursa (job #2763798)
#include <fstream>
#include <unordered_map>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
unordered_map<int, int> m;
int n, x;
int main() {
fin >> n;
for(int i = 1; i <= n; i++) {
fin >> x;
m[x]++;
}
fin.close();
int majoritar = -1, aparitii = 0;
unordered_map<int, int>::iterator itr;
for(itr = m.begin(); itr != m.end(); itr++) {
if(itr -> second > n / 2) {
majoritar = itr -> first;
aparitii = itr -> second;
break;
}
}
fout << majoritar;
if(majoritar != -1) {
fout << " " << aparitii;
}
fout.close();
return 0;
}