Cod sursa(job #3205224)
| Utilizator | Data | 19 februarie 2024 09:32:28 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.7 kb |
#include <cmath>
#include <cstring>
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int main()
{
int v[1000001], n, i, curr, k;
fin >> n;
for(i=1; i<=n; i++)
fin >> v[i];
curr=v[1];
k=1;
for(int i=2; i<=n; i++)
{
if(v[i]==curr)
k++;
else
{
k--;
if(k<0)
{
curr=v[i];
k=1;
}
}
}
k=0;
for(i=1; i<=n; i++)
if(v[i]==curr)
k++;
if(k>n/2)
fout << curr << " " << k;
else
fout << "-1";
return 0;
}
