Cod sursa(job #2214689)
Utilizator | Data | 19 iunie 2018 17:23:06 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
int f[2000000];
int main()
{
ifstream cin("elmaj.in");
ofstream cout("elmaj.out");
int n,a,max=0,l=0;
cin>>n;
int v[n];
for(int i=0;i<n;i++)
{
cin>>a;
f[a]++;
v[i]=a;
}
for(int i=0;i<n;i++)
{
if(f[v[i]]>=n/2+1 && f[v[i]]>max)
{
max=f[v[i]];
l=v[i];
}
}
cout<<l<<" "<<max;
return 0;
}