Cod sursa(job #1575507)
| Utilizator | Data | 21 ianuarie 2016 16:39:08 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
using namespace std;
#define MAX 1000001
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n , nr , cand , k ,i ;
int v[MAX] ;
int main()
{
f >> n;
for ( i = 1 ; i <= n ; i++ )
f >> v[i] ;
cand = -1;
for ( i = 1 ; i <= n ; i++ )
if ( k == 0 )
k++, cand = v[i];
else
if ( cand == v[i]) k++;
else k--;
for ( i = 1; i <= n ; i++ )
if( v[i] == cand )
nr++;
if ( nr > n/2 ) g << cand <<" "<< nr;
else g << -1;
return 0;
}
