Pagini recente » Cod sursa (job #1323790) | Cod sursa (job #2264719) | Cod sursa (job #2036873) | Cod sursa (job #1703872) | Cod sursa (job #1999551)
#include <fstream>
using namespace std;
int n,i,k,el,v[1000005];
int main()
{
ifstream f("elmaj.in");
ofstream g("elmaj.out");
f>>n;
for(i=1; i<=n; i++)
{
f>>v[i];
if(k==0)
{
k=1;
el=v[i];
}
else
if(el==v[i]) k++;
else k--;
}
if(k)
{
k=0;
for(i=1; i<=n; i++)
{
if(v[i]==el) k++;
}
if(k>n/2)
{
g<<el<<" "<<k<<'\n';
return 0;
}
}
g<<"-1\n";
f.close(); g.close();
return 0;
}