Pagini recente » Cod sursa (job #1736555) | Cod sursa (job #1846743) | Cod sursa (job #1346246) | Cod sursa (job #1354558) | Cod sursa (job #652064)
Cod sursa(job #652064)
#include <fstream>
using namespace std;
long long v[2 * 10000000], v1[2 * 10000000], n;
int NrAparitii(int x)
{
int k(0);
for(int i = 0; i < n; i++)
if(x == v[i])
++k;
return (k);
}
int main()
{
int i, ap;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
f >> n;
ap = n / 2 + 1;
for(i = 0; i < n; i++) f >> v[i];
for(i = 0; i < n; i++) v1[i] = NrAparitii(v[i]);
for(i = 0; i < n; i++)
{
if(v1[i] >= ap)
{
g << v[i] << " " << v1[i];
return 0;
}
}
g << (-1);
return 0;
}