Pagini recente » Cod sursa (job #1480380) | Atasamentele paginii cartofeala_2 | Cod sursa (job #3265954) | Cod sursa (job #2343602) | Cod sursa (job #2705669)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("elmaj.in");
ofstream g ("elmaj.out");
int n, a[1000001], i, x, k, j;
int main()
{
f >> n;
for (i=1; i<=n; i++)
f >> a[i];
for (i=1; i<=n; i++)
{
f >> a[i];
k = 0;
for (j=1; j<=n; j++)
if (a[i] == a[j])
{
k++;
x = a[i];
}
}
if (k >= n/2+1)
g << x << " " << k;
else
g << -1;
return 0;
}