Cod sursa(job #2132571)
Utilizator | Data | 15 februarie 2018 21:07:18 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int main()
{
long long v[1000000];
int n;
fin>>n;
for(int i=0;i<n;i++)
fin>>v[i];
sort(v,v+n);
int mj=v[0],c=1;
for(int i=1;i<n;i++)
{
if(v[i]==mj)
c++;
else
{
if(c>n/2)
{
fout<<mj<<" "<<c;return 0;
}
c=1;
mj=v[i];
}
}
fout<<"-1";
return 0;
}