Pagini recente » Istoria paginii utilizator/foroji2019 | Cod sursa (job #1005584) | Cod sursa (job #226750) | Cod sursa (job #1043987) | Cod sursa (job #1254064)
#include<fstream>
using namespace std;
ifstream f("elmaj.in"); ofstream g("elmaj.out");
int n,i,k,cand,nr,a[1000001];
int main()
{ f>>n;
for(i=1;i<=n;i++) f>>a[i];
for(i=1;i<=n;i++)
if(k==0) {cand=a[i]; k=1;}
else if(a[i]==cand) k++; else k--;
for(i=1;i<=n;i++) if(a[i]==cand) nr++;
if(nr<=n/2) g<<"-1\n"; else g<<cand<<' '<<nr<<'\n';
g.close(); return 0;
}