Cod sursa(job #1509863)
| Utilizator | Data | 24 octombrie 2015 12:59:33 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <fstream>
using namespace std;
ifstream in ("elmaj.in");
ofstream out ("elmaj.out");
int main()
{
int k=0, n, contor=0, i, v[1000010], nr;
in>>n;
for( i=0; i<n; i++)
{
in>>v[i];
}
for( i=0; i<n; i++)
{
if( k==0)
{
nr=v[i];
k++;
}
else
{
if( nr!=v[i])
k--;
if( nr==v[i])
k++;
}
}
for( i=0; i<n; i++)
{
if( nr==v[i])
contor++;
}
if( contor>=n/2+1)
out<<nr<<" "<<contor<<'\n';
else
out<<"-1"<<'\n';
return 0;
}
