Pagini recente » Cod sursa (job #2656556) | Cod sursa (job #601669) | Cod sursa (job #702265) | Cod sursa (job #391562) | Cod sursa (job #1975745)
#include <fstream>
using namespace std;
long long x,k,v[1000010];
int n,p,nr,i;
int main()
{
ifstream f("elmaj.in");
ofstream g("elmaj.out");
f>>n;
for(i=1;i<=n;i=i+1)
{
f>>x;
v[i]=x;
}
k=v[1];p=1;
for(i=2;i<=n;i=i+1)
{
if(v[i]==k)
p=p+1;
else
p=p-1;
if(p==-1)
{
k=v[i];
p=1;
}
}
if(p>=1)
{
for(i=1;i<=n;i=i+1)
if(v[i]==k)
nr=nr+1;
if(nr>=(n/2+1))
g<<k<<' '<<nr;
else
g<<-1;
}
else
g<<-1;
return 0;
}