Cod sursa(job #2197581)
Utilizator | Data | 22 aprilie 2018 15:28:41 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include<fstream>
#include<algorithm>
using namespace std;
ifstream cin("elmaj.in");
ofstream cout("elmaj.out");
int n,v[1000005];
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
cin>>v[i];
sort(v+1,v+n+1);
int nr,i=1;
while(i<=n)
{
nr=1;
while(v[i]==v[i+1] && i<=n)
{++i; ++nr;}
if(nr>n/2)
{
cout<<v[i]<<' '<<nr;
return 0;
}
++i;
}
cout<<-1;
}