Cod sursa(job #1914014)
Utilizator | Data | 8 martie 2017 15:08:48 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <bits/stdc++.h>
#define DM 1000001
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int v[DM],n,lm;
int main()
{
fin>>n;
for(int i=1;i<=n;++i)
fin>>v[i];
sort(v+1,v+n+1);
int sol=1,maj=0;
for(int i=2;i<=n;++i){
if(v[i]==v[i-1]) sol++;
else{
if(lm<sol) lm=sol,maj=v[i-1];
sol=1;
}
}
fout<<maj<<" "<<lm;
return 0;
}