Pagini recente » Cod sursa (job #849258) | Cod sursa (job #2444681) | Cod sursa (job #2381808) | Cod sursa (job #1199404) | Cod sursa (job #2252829)
#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;
}
}