Cod sursa(job #2252829)
| Utilizator | Data | 3 octombrie 2018 09:42:55 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Teme Pregatire ACM Unibuc 2013 | Marime | 0.65 kb |
#include <iostream>
#include <algorithm>
#include <fstream>
#include <iomanip>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int v[1000001],mx,nr,n,p;
int main()
{
f>>n;
for(int i=1;i<=n;i++){
cin>>v[i];
}
sort(v+1,v+n+1);
nr=1;
for(int i=2;i<=n;i++){
if(v[i]==v[i-1]){
nr++;
}else{
if(nr>mx){
mx=nr;
p=v[i-1];
}
nr=1;
}
}
if(nr>mx){
mx=nr;
p=v[n];
}
if(mx>=n/2+1){
g<<p<<' '<<mx;
}else{
g<<-1;
}
}
