Cod sursa(job #1596876)
Utilizator | Data | 11 februarie 2016 14:47:10 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.76 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n,i,j,nr,max1,min1,cate,maxap,v[1000002];
int main()
{
f>>n;
min1=2000000001;
for(i=1;i<=n;i++)
{
f>>v[i];
if(v[i]>max1)
max1=v[i];
if(v[i]<min1)
min1=v[i];
}
maxap=n/2+1;
for(i=min1;i<=max1;i++)
{
cate=0;
for(j=1;j<=n;j++)
if(v[j]==i)
cate++;
if(cate>=maxap)
{
maxap=cate;
nr=i;
}
}
if(maxap==0)
g<<-1;
else
g<<nr<<" "<<maxap;
return 0;
}