Pagini recente » Cod sursa (job #1451701) | Cod sursa (job #2579338) | Cod sursa (job #1403268) | Cod sursa (job #641991) | Cod sursa (job #3278560)
#include <fstream>
#include <unordered_map>
using namespace std;
unordered_map <int, int> f;
int main(){
int n, i, x, max_ap, r;
ifstream fin( "elmaj.in" );
ofstream fout( "elmaj.out" );
fin >> n;
max_ap = r = -1;
for( i = 0; i < n; i++ ){
fin >> x;
f[x]++;
if( f[x] > max_ap ){
max_ap = f[x];
r = x;
}
}
if( f[r] < n / 2 + 1 ){
fout << -1;
}
else{
fout << r << ' ' << max_ap;
}
return 0;
}