Cod sursa(job #2252816)
Utilizator | Data | 3 octombrie 2018 09:35:57 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
#include <iomanip>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n,nr,mx,nrmx,v[1000001];
int main()
{
f>>n;
nr=1;
for(int i=1;i<=n;i++)
{
f>>v[i];
}
sort(v+1,v+n+1);
for(int i=2;i<=n;i++)
{
if(v[i]==v[i-1])nr++;
else
{if(nr>mx){mx=nr;nrmx=v[i-1];}
nr=1;}
}
if(nr>mx){mx=nr;nrmx=v[n];}
g<<nrmx<<" "<<mx;
return 0;
}