Cod sursa(job #2128172)
| Utilizator | Data | 11 februarie 2018 15:16:05 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
#include <algorithm>
using namespace std ;
ifstream fin ( "elmaj.in" ) ;
ofstream fout ( "elmaj.out" ) ;
const int NMAX = 1e6 ;
int v [ NMAX + 5 ] ;
int main ( )
{
int i , n , cnt = 0 ;
fin >> n ;
for( i = 1 ; i <= n ; i ++ )
fin >> v [ i ] ;
sort ( v + 1 , v + n + 1 ) ;
for ( i = 1 ; i <= n ; i ++ ) {
if( v [ i - 1 ] != v [ i ] ) {
if( cnt >= n / 2 + 1 )
fout << v [ i - 1 ] << " " << cnt ;
cnt = 1 ;
}
else cnt ++ ;
}
return 0;
}
