Cod sursa(job #2643871)
| Utilizator | Data | 21 august 2020 23:04:14 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
int v[1000001], n;
int nr, c;
int main()
{
in>>n;
in>>v[1], nr=v[1], ++c;
for(int i=2; i<=n; i++)
{
in>>v[i];
if(!c) nr=v[i], ++c;
if(v[i]==nr) ++c;
else --c;
}
c=0;
for(int i=1; i<=n; i++) c+=!!(nr==v[i]);
if(c>=n/2+1) out<<nr<<' '<<c;
else out<<-1;
return 0;
}
