Cod sursa(job #1541675)
Utilizator | Data | 4 decembrie 2015 14:47:54 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream in("elmaj.in");
ofstream out("elmaj.out");
long long n,v[1000001],w[1000001];
in>>n;
for(int i=1;i<=n;i++)
{in>>v[i];w[v[i]]=0;}
for(int i=1;i<=n;i++)
{w[v[i]]++;}
for(int i=1;i<=n;i++)
{
if(w[v[i]]>=n/2+1){out<<v[i]<<' '<<w[v[i]];return 0;}
}
out<<-1;
return 0;
}