Cod sursa(job #863999)
| Utilizator | Data | 24 ianuarie 2013 16:03:03 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include<fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n,t,a[1000001],b[1000001],m,i,j,nr,p;
int main()
{ f>>n;
for(i=1;i<=n;++i) { f>>a[i];
t=1;
for(j=1;j<=m;++j) if(a[i]==b[j]) t=0;
if(t==1) { ++m;
b[m]=a[i];
}
}
for(j=1;j<=m;++j) { nr=0;
for(i=1;i<=n;++i) if(a[i]==b[j])++nr;
if(nr>=n/2+1) { g<<b[j]<<" "<<nr;
j=m+1;
p=1;
}
}
if(p==0) g<<"-1";
return 0;
}
