Pagini recente » Cod sursa (job #1388448) | Cod sursa (job #199895) | Cod sursa (job #1616025) | Diferente pentru autumn-warmup-2007/solutii/runda-2 intre reviziile 56 si 46 | Cod sursa (job #3277890)
#include <fstream>
#include <iostream>
using namespace std;
ifstream cin("elmaj.in");
ofstream cout("elmaj.out");
int v[1000009];
int main () {
int n;
cin>>n;
for (int i=1; i<=n; i++)
cin>>v[i];
int candidat=0, k=0;
for (int i=1; i<=n; i++) {
if (!k) candidat=v[i], k=1;
else {
if (v[i]==candidat) k++;
else k--;
}
}
cout<<candidat;
int nr=0;
for (int i=1; i<=n; i++) if (v[i]==candidat) nr++;
if (nr>n/2) cout<<candidat<<' '<<nr;
else cout<<-1;
}