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