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