Cod sursa(job #1373752)
Utilizator | Data | 4 martie 2015 20:25:32 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
#define nmax 1000000000000005
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
unsigned long long n,maxim,i,j,c,nr,ok;
int a[1000001];
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
c=1; ok=0;
for(i=1;i<=n;i++)
{
nr=0;
for(j=1;j<=n;j++)
if(a[i]==a[j])nr++;
if(nr>=(n/2+1)){g<<a[i]<<" "<<nr;ok=1;break;}
}
if(ok==0)g<<"-1";
return 0;
}