Pagini recente » Cod sursa (job #398258) | Cod sursa (job #159829) | Cod sursa (job #153290) | Cod sursa (job #1062767) | Cod sursa (job #1305888)
#include<stdio.h>
#include<iostream>
#include<fstream>
#include<vector>
#include<algorithm>
#include<limits.h>
using namespace std;
int main()
{
ifstream si;
si.open("elmaj.in");
FILE* so=fopen("elmaj.out","w");
int n,i,maxx=0,nr;
si>>n;
int v[n];
for(i=0;i<n;++i)
si>>v[i];
sort(v,v+n);
int c;
c=1;
for(i=1;i<n;++i)
{
if(v[i-1]==v[i])
{
++c;
}
else
{
if(maxx<c)
{
maxx=c;
nr=v[i-1];
}
c=1;
}
}
--n;
if(maxx>n/2)
{
so<<nr<<' '<<maxx<<endl;
}
else
so<<-1<<endl;
}