Pagini recente » Cod sursa (job #1173147) | Cod sursa (job #2279585) | Cod sursa (job #362357) | Cod sursa (job #2712945) | Cod sursa (job #2215858)
#include<cstdio>
#define MAX_N 1000000
using namespace std;
int v[MAX_N], candidat, ap, n;
int main() {
int i;
FILE* fin, *fout;
fin = fopen("elmaj.in","r");
fout = fopen("elmaj.out","w");
fscanf(fin,"%d",&n);
for(i = 0; i < n; i++)
fscanf(fin,"%d",&v[i]);
candidat = v[0];
ap = 1;
for(i = 1; i < n; i++) {
if(v[i] == candidat)
ap++;
else if(ap)
ap--;
else {
candidat = v[i];
ap = 1;
}
}
ap = 0;
for(i = 0; i < n; i++)
if(v[i] == candidat)
ap++;
if(ap >= n/2 + 1)
fprintf(fout,"%d %d\n",candidat,ap);
else fprintf(fout,"-1\n");
fclose(fin);
fclose(fout);
return 0;
}