Cod sursa(job #2029479)
| Utilizator | Data | 30 septembrie 2017 10:55:23 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int main()
{
long long n,v[100],k,x;
fin>>n;
for(int i=1;i<=n;i++)
{
fin>>v[i];
if(i==1){x=v[i]; k=1;}
else
{
if(x==v[i])k++;
else k--;
if(k==0)
{
x=v[i];
k=1;
}
}
}
k=0;
for(int i=1;i<=n;i++)
if(v[i]==x)k++;
if(k>n/2)fout<<x<<' '<<k;
else fout<<-1;
return 0;
}
