Cod sursa(job #1906313)
Utilizator | Hernest Mihai mihaihernest | Data | 6 martie 2017 13:18:38 |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.63 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n,i,cate,max1,nr,a[1000005];
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
max1=a[1];
cate=1;
for(i=1;i<=n;i++)
if(a[i]==max1)
cate++;
else
{
cate--;
if(cate<0)
{
max1=a[i];
cate=1;
}
}
nr=0;
for(i=1;i<=n;i++)
if(a[i]==max1)
nr++;
if(nr>n/2)
g<<max1<<" "<<nr;
else
g<<-1;
return 0;
}