Pagini recente » Cod sursa (job #3170458) | Cod sursa (job #322559) | Cod sursa (job #1309101) | Cod sursa (job #797734) | Cod sursa (job #1380194)
#include <fstream>
using namespace std;
int a[1000000];
int main()
{
int i,n,el,k;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
f>>n;
for(i=0,k=0;i<n;++i)
{
f>>a[i];
if(!k)
{
el=a[i];
k=1;
}
else
{
if(el==a[i]) ++k;
else --k;
}
}
for(i=0,k=0;i<n;++i)
{
if(a[i]==el) ++k;
}
if(k>n/2) g<<el<<" "<<k<<endl;
else g<<"-1"<<endl;
f.close();
g.close();
return 0;
}