Cod sursa(job #2645385)
Utilizator | Data | 28 august 2020 10:07:19 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.69 kb |
#include <fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int v[1000001],n,m,ap;
int main()
{
f>>n;
for(int i=1; i<=n; ++i)
{
f>>v[i];
}
m=v[1];
ap=1;
for(int i=2; i<=n; ++i)
{
if(v[i]!=m)
{
ap--;
}
else
{
ap++;
}
if(ap<0)
{
ap=1;
m=v[i];
}
}
ap=0;
for(int i=1; i<=n; ++i)
{
if(v[i]==m)
{
ap++;
}
}
if(ap>=n/2+1)
{
g<<m<<" "<<ap;
}
else
{
g<<-1;
}
return 0;
}