Pagini recente » Cod sursa (job #1197127) | Cod sursa (job #1446882) | Cod sursa (job #1496458) | Cod sursa (job #2944212) | Cod sursa (job #1455489)
#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;
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]);
break;
}
}
}
return 0;
}