Cod sursa(job #1537953)
Utilizator | Data | 28 noiembrie 2015 12:22:55 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <fstream>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int n,a[1000001],f[2000],maxim,i;
int main()
{
fin>>n;
for(i=1;i<=n;i++) {fin>>a[i]; f[a[i]]++; if(a[i]>maxim) maxim=a[i];}
for(i=1;i<=maxim;i++) if(f[i]>=(n/2+1)) fout<<i<<" "<<f[i];
return 0;
}