Pagini recente » Cod sursa (job #1814129) | Cod sursa (job #1885332) | Cod sursa (job #1940925) | Cod sursa (job #2174770) | Cod sursa (job #716397)
Cod sursa(job #716397)
#include <fstream>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
unsigned long long n,a[1000002];
void solve()
{
unsigned long long cand=-1,k=0,i,nr=0;
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+1)
fout<<cand<<' '<<nr;
else fout<<-1;
}
int main()
{
unsigned long long i;
fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
solve();
return 0;
}