Cod sursa(job #1221254)
| Utilizator | Data | 19 august 2014 22:53:04 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n,nr,i,k,cand,a[1000001];
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
cand=-1;
k=1
;
for(i=1;i<=n;i++)
{
if(cand==a[i])
k++;
else
k--;
if(k==0)
{
cand=a[i];
k=1;
}
}
nr=0;
for(i=1;i<=n;i++)
{
if(cand==a[i])
nr++;
}
if(nr>n/2)
g<<cand<<" "<<nr;
else
g<<-1;
return 0;
}
