Cod sursa(job #2518440)
Utilizator | Data | 5 ianuarie 2020 18:55:33 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 80 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <cstdio>
#include <map>
using namespace std;
int main()
{
freopen("elmaj.in", "r", stdin);
freopen("elmaj.out", "w", stdout);
int n;
map<int, int> m;
scanf("%d", &n);
int x;
int elmaj = -1;
for(int i = 0; i < n; ++i)
{
scanf("%d", &x);
++m[x];
if(m[x] > n / 2)
elmaj = x;
}
printf("%d %d\n", elmaj, m[elmaj]);
return 0;
}