Cod sursa(job #2208944)
Utilizator | Data | 1 iunie 2018 12:16:30 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
#include <map>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
map <int, int> mp;
int main()
{
int n;
in >> n;
int x = -1;
for(int i = 1; i <= n; i ++)
{
int a;
in >> a;
mp[a] ++;
if(mp[a] >= n / 2 + 1)
x = a;
}
if(x != -1)
out << x << " " << mp[x];
else
out << "-1";
return 0;
}