Pagini recente » Cod sursa (job #2927895) | Cod sursa (job #2338699) | Cod sursa (job #3259667) | Cod sursa (job #3038247) | Cod sursa (job #1455490)
#include <stdio.h>
#include <map>
using namespace std;
int main(){
freopen("elmaj.in","r",stdin);
freopen("elmaj.out","w",stdout);
int N, x, i;
map<int,int> occurances;
bool flag = false;
scanf("%d ", &N);
for (i=0; i<N; i++){
scanf("%d ", &x);
if(occurances.find(x) == occurances.end())
occurances[x] = 1;
else{
occurances[x] ++;
if(occurances[x] >= N/2 +1){
printf("%d %d", x, occurances[x]);
flag = true;
break;
}
}
}
if(flag == false)
printf("-1");
return 0;
}