Cod sursa(job #1811176)
Utilizator | Data | 20 noiembrie 2016 21:48:49 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <unordered_map>
#include <vector>
#include <cstdio>
using namespace std;
unordered_map<int,int>m;
int a[1000000], n;
int main()
{
freopen("elmaj.in","r",stdin);
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%d",&a[i]);
m[a[i]]++;
}
freopen("elmaj.out","w",stdout);
for(int i=0;i<n;i++)
{
if(m[a[i]]>=n/2+1)
{
printf("%d %d",a[i],m[a[i]]);
return 0;
}
}
return 0;
}