Cod sursa(job #1455489)
| Utilizator | Data | 28 iunie 2015 03:27:06 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#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;
}
