Cod sursa(job #2115737)
| Utilizator | Data | 27 ianuarie 2018 09:23:19 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include <algorithm>
#include <fstream>
#define MAX 1000001
using namespace std;
int n,a[MAX],m,mmax,elmax;
int main()
{
ifstream f ("elmaj.in");
ofstream g ("elmaj.out");
f>>n;
for(int i=1;i<=n;i++)f>>a[i];
sort(a+1,a+n+1);
m=mmax=1;elmax=a[1];
for(int i=2;i<=n;i++){
if(a[i]!=a[i-1])m=1;
else m++;
if(m>=mmax)mmax=m,elmax=a[i];
}
if(m>=mmax)mmax=m,elmax=a[n];
if(mmax<n/2+1)g<<"-1\n";
else g<<elmax<<" "<<mmax<<'\n';
f.close ();
g.close ();
return 0;
}
