Cod sursa(job #1959669)
| Utilizator | Data | 9 aprilie 2017 19:36:38 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int n;
long long v[1000004];
int main(){
fin>>n;
int maxim=0, poz;
for(int i=1; i<=n; ++i){
fin>>v[i];
int k=0;
for(int j=1; j<=i; ++j) if(v[i]==v[j]) ++k;
if(k>maxim) maxim = k, poz = v[i];
}
if(maxim >= n/2 + 1) fout<<poz<<" "<<maxim;
else fout<<-1;
return 0;
}
