Pagini recente » Cod sursa (job #1966795) | Cod sursa (job #2360335) | Cod sursa (job #2762858) | Cod sursa (job #1808826) | Cod sursa (job #2541051)
#include <fstream>
#include <cstring>
using namespace std;
ifstream f ("elmaj.in");
ofstream g ("elmaj.out");
int n, i, aparitii, element, v[1000005];
int main()
{
f >> n;
for (i=1; i<=n; i++)
f >> v[i];
element = v[1], aparitii = 1;
for (i=2; i<=n; i++)
{
if (aparitii)
{
if (v[i] == element)
aparitii ++;
else
aparitii --;
}
else {
element = v[i];
aparitii = 1;
}
}
if (aparitii > 0)
{
int cnt = 0;
for (i=1; i<=n; i++)
{
if (v[i] == element)
cnt ++;
}
if (cnt >= n/2+1)
g << element << " " << cnt;
else
g << -1;
}
return 0;
}