Pagini recente » Cod sursa (job #1186657) | Cod sursa (job #2571695) | Cod sursa (job #2056373) | Cod sursa (job #753174) | Cod sursa (job #1784696)
#include <bits/stdc++.h>
using namespace std;
int main()
{
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n,a[500001],gasit=-1,ap=-1;
f>>n;
for(int i=0; i<n; i++)
{
f>>a[i];
}
for (int i = 0; i < n; i++) {
int nr = 0;
for (int j = 0; j < n; j++) {
if (a[j]==a[i])
nr++;
}
if (nr > n / 2)
{
gasit=a[i];
ap=nr;
}
}
if(ap!=-1)
g<<gasit<<" "<<ap;
else
g<<"-1";
return 0;
}