Pagini recente » Cod sursa (job #154898) | Atasamentele paginii nu_merge_arhiva_de_probleme | Cod sursa (job #1785503) | Cod sursa (job #301895) | Cod sursa (job #1755476)
#include <stdio.h>
using namespace std;
const int N = 1000001;
int v[N];
int main()
{
FILE *in, *out;
in = fopen ("elmaj.in", "r");
out = fopen ("elmaj.out", "w");
int i, n;
fscanf(in, "%d", &n);
for (i = 0; i < n; i++)
fscanf(in, "%d", &v[i]);
int nrap = 0, cand = -1;
for (i = 0; i < n; i++)
{
if(cand != v[i] && nrap == 0)
{
nrap = 1;
cand = v[i];
}
else
{
if (cand == v[i])
nrap++;
else
nrap--;
}
}
nrap = 0;
for (i = 0; i < n; i++)
{
if(v[i] == cand)
nrap++;
}
if(nrap >= n/2+1)
fprintf(out, "%d %d", cand, nrap);
else
fprintf(out, "-1");
return 0;
}