Cod sursa(job #2451081)
Utilizator | Popescu Andrei Alexandru PopescuAndreiAlexandru | Data | 25 august 2019 16:43:27 |
---|---|---|---|
Problema | Elementul majoritar | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.69 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
#define nmax 1000005
unsigned int v[nmax],Task,nr=0,nrf=0,x;
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
{
fin>>v[i];
if(!nr)
{
nr++;
Task=v[i];
}
else
{
if(Task!=v[i])
nr--;
else
nr++;
}
}
for(int i=1;i<=n;i++)
{
if(Task==v[i])
nrf++;
}
if(nrf>n/2)
fout<<Task<<" "<<nrf<<'\n';
else
fout<<-1<<'\n';
}