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