Cod sursa(job #1160195)
Utilizator | Data | 30 martie 2014 12:48:49 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
#include <algorithm>
using namespace std;
#define NMax 1000005
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n,k;
int v[NMax];
int ap;
int main()
{
int i;
f>>n;
for(i=1;i<=n;i++) f>>v[i];
k=n/2+1;
nth_element(v+1,v+k,v+n+1);
for(i=1;i<=n;i++) if(v[i]==v[k]) ap++;
g<<v[k]<<" "<<ap<<"\n";
f.close();
g.close();
return 0;
}