Pagini recente » Cod sursa (job #2363633) | Cod sursa (job #2923525) | Cod sursa (job #1485351) | Cod sursa (job #266712) | Cod sursa (job #1455488)
#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] ++;
}
for (i=0; i<N;i++)
if(occurances[i] >= N/2 +1){
printf("%d %d", i, occurances[i]);
break;
}
return 0;
}