Cod sursa(job #1811173)
Utilizator | Data | 20 noiembrie 2016 21:46:30 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <unordered_map>
#include <vector>
#include <fstream>
using namespace std;
unordered_map<int,int>m;
int a[1000000], n;
int main()
{
ifstream in("elmaj.in");
in>>n;
for(int i=0;i<n;i++)
{
in>>a[i];
m[a[i]]++;
}
ofstream out("elmaj.out");
for(int i=0;i<n;i++)
{
if(m[a[i]]>=n/2+1)
{
out<<a[i]<<' '<<m[a[i]];
return 0;
}
}
out<<-1;
return 0;
}