Cod sursa(job #1571861)
| Utilizator | Data | 18 ianuarie 2016 16:31:32 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.66 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int main()
{
int n,v[100],ep,ap,k;
f>>n;
k=2;
for(int i=1;i<=n;i++)
f>>v[i];
ep=v[1];
ap=1;
while(k<=n)
{
if(v[k]==ep)
{
ap++;
}
else
{
ap--;
if(ap==0)
{
ep=v[k];
ap=1;
}
}
k++;
}
k=0;
for(int i=1;i<=n;i++)
{
if(v[i]==ep)
k++;
}
if(k>n/2)
g<<ep<<" "<<k;
else
g<<"-1";
return 0;
}
