Pagini recente » Cod sursa (job #1370232) | Cod sursa (job #304291) | Cod sursa (job #1745919) | Cod sursa (job #2594614) | Cod sursa (job #2684680)
#include <fstream>
#include <algorithm>
using namespace std;
int v[ 1000000 ], n;
int main()
{
int vel, nr = 0;
ifstream cin( "elmaj.in" );
cin >> n;
for( int i = 0; i < n; i++ )
cin >> v[ i ];
cin.close();
sort( v, v + n );
int i = n / 2, j = n / 2 + 1, val = v[ n / 2 ];
while( i > 0 && v[ i ] == val )
--i, nr++;
while( j < n && v[ j ] == val )
++j, nr++;
ofstream cout( "elmaj.out" );
if( nr > n / 2 )
cout << val << ' ' << nr << '\n';
else cout << "-1\n";
return 0;
}