Cod sursa(job #643129)
Utilizator | Data | 2 decembrie 2011 23:35:13 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include<fstream>
using namespace std;
int main()
{
long a[100000005],i,j,nr,n;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=n;i++)
{nr=0;
for(j=1;j<=n;j++)
if(a[i]==a[j])
nr++;
}
if(nr/2>n)
g<<a[i]<<" "<<nr;
else
g<<-1;
f.close();
g.close();
return 0;
}