Cod sursa(job #2254052)
Utilizator | Data | 4 octombrie 2018 18:45:36 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.72 kb |
#include <fstream>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
long long v[1000005];
int main()
{
int n,i,a,gigel=0,costel=0;
in>>n;
for (i=1;i<=n;i++)
in>>v[i];
a=v[1];
gigel=1;
for (i=2;i<=n;i++)
{
if (v[i]==a)
gigel++;
else
{
if (gigel==1)
{
a=v[i];
gigel=1;
}
else
{
gigel--;
}
}
}
for (i=1;i<=n;i++)
{
if (v[i]==a)
costel++;
}
if (costel>=n/2+1)
out<<a<<" "<<costel;
else
out<<-1;
return 0;
}