Pagini recente » Cod sursa (job #3161587) | Cod sursa (job #1115392) | Cod sursa (job #3267881) | Cod sursa (job #11278) | Cod sursa (job #2371030)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f ("elmaj.in");
ofstream g ("elmaj.out");
int n, cand, k, nr, a[1000001];
int main ()
{
f >> n;
cand=-1;
k=0;
for (int i=1; i<=n; i++)
{
f >> a[i];
if (k==0)
{
cand=a[i];
k=1;
}
else if (a[i]==cand) k++;
else k--;
}
if (cand==-1) g << -1;
else {
nr=0;
for (int i=1; i<=n; i++)
if (a[i]==cand) nr++;
if (nr>n/2)
g << cand << " " << nr;
else g << -1;
}
return 0;
}