Cod sursa(job #2409831)
Utilizator | Data | 19 aprilie 2019 14:07:42 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
const int N=1000005;
int n,cnt,v[N];
int main()
{
in>>n;
for(int i=1;i<=n;i++)
in>>v[i];
sort(v+1,v+n+1);
out<<v[n/2]<<' ';
for(int i=1;i<=n;i++)
if(v[i]==v[n/2])
cnt++;
out<<--cnt;
return 0;
}