Pagini recente » Cod sursa (job #187378) | Cod sursa (job #839522) | Cod sursa (job #90542) | Cod sursa (job #701559) | Cod sursa (job #1974656)
# include <fstream>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
int n, sm, w, cnt, maxim, nr;
int v[1000010];
int main()
{
in >> n;
cnt = 1;
w = 1;
for (int i = 1; i <= n; i++)
in >> v[i];
sm = v[1];
for (int i = 1; i < n; i++)
{
if (v[i] == v[i+1])
{
w++;
cnt++;
if (w > maxim)
maxim = w;
}
else
{
w = 1;
cnt--;
if (cnt == 0)
{
sm = v[i+1];
cnt = 1;
}
}
}
for (int i = 1; i <= n; i++)
{
if (v[i] == sm)
nr++;
}
if (nr >= n/2 + 1)
out << sm << ' ' << nr;
else
out << -1;
return 0;
}