Cod sursa(job #2040491)
Utilizator | Data | 15 octombrie 2017 21:24:24 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
long long v[1000001];
int main()
{
int cnd=0,k=0,nr=0;
//ong long v[1000000];
long long n;
fin>>n;
for(int i=1;i<=n;i++)
{
fin>>v[i];
if(k==0)
{
cnd=v[i];k++;
}
else
{
if(v[i]==cnd)k++;
else k--;
}
}
for(int i=1;i<=n;i++)
if(v[i]==cnd)nr++;
if(nr>n/2)fout<<cnd<<" "<<nr;
else fout<<"-1";
return 0;
}