Cod sursa(job #2034779)
Utilizator | Data | 8 octombrie 2017 13:46:33 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.65 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
long long n, a[1000003], k, x;
int main()
{
f>>n;
for(int i=1;i<=n;i++)
{
f>>a[i];
if(i==1)
{
x=a[i];
k=1;
}
else
{
if(x==a[i])
k++;
else k--;
if(k==0)
{
x=a[i];
k=1;
}
}
}
k=0;
for(int i=1;i<=n;i++)
if(a[i]==x)
k++;
if(k>n/2)
g<<x<<" "<<k;
else g<<-1;
return 0;
}