Cod sursa(job #1324452)
Utilizator | Data | 22 ianuarie 2015 12:30:48 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include<fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int a[1000001],i,j,n,l,k;
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=n;i++)
{
if(k==0)
{
l=a[i];
k=1;
}
else
if(a[i]==l)
k++;
else
k--;
}
for(i=1;i<=n;i++)
if(a[i]==l)
j++;
if(j<(n/2)+1)
g<<"-1";
else
g<<l<<" "<<j;
return 0;
}