Cod sursa(job #1588939)
Utilizator | Data | 3 februarie 2016 18:41:44 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include<algorithm>
#include<fstream>
using namespace std;
int v[1000005],a[999999],n;
int main()
{
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int i,j,x,maxim,y;
fin>>n;
x=(n/2)+1;
for(i=1;i<=n;i++)
fin>>v[i];
for(i=1;i<=n;i++)
{
a[v[i]]++;
if(a[v[i]]>=x)
{
maxim=a[v[i]];
y=v[i];
}
}
if(x>maxim)fout<<"-1";
else
fout<<y<<" "<<maxim;
fin.close();
fout.close();
}