Cod sursa(job #856289)
Utilizator | Data | 16 ianuarie 2013 10:32:25 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int main()
{
long n,i,e,k=0;
int v[1000000];
f >> n;
for(i=0;i<n;i++)f >> v[i];
sort(v+1,v+n+1);
if(v[1]==v[n/2] || v[n]==v[n/2])e=v[n/2];
for(i=0;i<n;i++)
if(v[i]==e)k++;
g << e << " " << k;
return 0;
}