Cod sursa(job #2616508)
| Utilizator | Data | 18 mai 2020 18:38:52 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.75 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream in ("elmaj.in");
ofstream out ("elmaj.out");
int main()
{
int n;
in>>n;
int v[n];
for(int i=0;i<n;i++)
{
in>>v[i];
}
int cand=v[0];
int cnt=1;
for(int i=1;i<n;i++)
{
if(v[i]==cand)
{
cnt++;
}
else
{
if(cnt==0)
{
cnt=1;
cand=v[i];
}
else
{
cnt--;
}
}
}
cnt=0;
for(int i=0;i<n;i++)
{
if(v[i]==cand)
{
cnt++;
}
}
if(cnt>n-cnt)
{
out<<cand<<' '<<cnt;
}
else
{
out<<"-1";
}
}
