Pagini recente » Cod sursa (job #2041643) | Cod sursa (job #2415567) | Autentificare | Cod sursa (job #2927461) | Cod sursa (job #1488970)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
int v[1000001],n;
int main()
{
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int i,val,ap=0;
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
val=-1;
for(i=1;i<=n;i++){
if(v[i]!=val){
ap--;
if(ap<0){
val=v[i];
ap=1;
}
}
else ap++;
}
ap=0;
for(i=1;i<=n;i++)
if(v[i]==val)ap++;
if(ap>=n/2+1) g<<val<<' '<<ap;
else g<<"-1";
return 0;
}