Cod sursa(job #2421320)
Utilizator | Data | 14 mai 2019 18:53:08 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
long long int v[1000000], d[2000000];
int main()
{
int i, maj, m=0, n;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>v[i];
d[v[i]]++;
if(m<v[i])
m=v[i];
}
maj=(n/2)+1;
for(i=1;i<=m;i++)
{
if(d[i]>=maj)
cout<<i<<" "<<d[i];
}
return 0;
}