Cod sursa(job #950288)
Utilizator | olteanu alexandru alexolteanu | Data | 16 mai 2013 15:08:00 |
---|---|---|---|
Problema | Elementul majoritar | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
#include <algprithm>
using namespace std;
int main()
{
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int n, v[1000000],nr=0;
fin>>n;
for(int i=0; i<n; i++)
fin>>v[i];
sort(v,v+n);
if(v[n/2]>n/2+1)
fout<<v[n/2];
for(int i=n/2; v[i]==v[i+1]; i++)
nr++;
for(int i=n/2-1; v[i]==v[i-1]; i--)
nr++;
fout<<endl<<nr;
return 0;
fin.close();
fout.close();
}