Cod sursa(job #1898691)
| Utilizator | Data | 2 martie 2017 10:47:39 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
long long n,i,v[1000000],l=1,x,nr,vnr,lmx=-1,a;
int main()
{
f>>n;
x=n/2+1;
for(i=1;i<=n;i++)
f>>v[i];
sort(v+1,v+n+1);
vnr=v[1];
for(i=2;i<=n;i++)
{
nr=v[i];
if(nr==vnr)l++;
else
{
if(l>=x){lmx=l;a=vnr;break;}
if(i>x)break;
l=1;
}
vnr=nr;
}
if(lmx==-1)g<<-1;
else g<<a<<" "<<lmx;
}
