Cod sursa(job #2368037)
| Utilizator | Data | 5 martie 2019 13:27:33 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.7 kb |
#include<iostream>
#include<fstream>
using namespace std;
int i, n, v[100000010], cnd, ap;
ifstream fin ("elmaj.in");
ofstream fout ("elmaj.out");
int main ()
{
fin>>n;
for (i=1; i<=n; i++)
fin>>v[i];
cnd=v[1];
ap=1;
for (i=2; i<=n; i++)
{
if (v[i]==cnd)
ap++;
else
{
ap--;
if (ap==-1)
{
cnd=v[i];
ap=1;
}
}
}
ap=0;
for (i=1; i<=n; i++)
if (v[i]==cnd)
ap++;
if (ap>=(n/2+1))
fout<<cnd<<" "<<ap;
else
fout<<-1;
fin.close();
fout.close();
return 0;
}
