Pagini recente » Cod sursa (job #1814608) | Cod sursa (job #76260) | Cod sursa (job #3179226) | Cod sursa (job #235210) | Cod sursa (job #2128172)
#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;
}