Cod sursa(job #3196309)
Utilizator | Andre Loga Andrei1105 | Data | 23 ianuarie 2024 16:03:56 |
---|---|---|---|
Problema | Elementul majoritar | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.74 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
long long n,v[1000010],k;
int candidat()
{
int c=v[1],pc=0;
for(int i=1; i<=n; i++)
{
if(c==v[i+1])
{
pc=v[i+1];
}
else
{
c=v[i+1];
}
}
if(pc)
return pc;
return 0;
}
int main()
{
fin>>n;
for(int i=1; i<=n; i++)
{
fin>>v[i];
}
int x=candidat();
if(x)
{
for(int i=1; i<=n; i++)
if(v[i]==x)
k++;
if(k>n/2)
fout<<x<<" "<<k;
else
fout<<-1;
}
else
{
fout<<-1;
}
}