Cod sursa(job #729865)
Utilizator | Data | 30 martie 2012 15:23:14 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
int N;
int v[1000000];
int Max,k;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int main()
{
int i,cif,sol;
f>>N;
for(i = 0 ; i < N; i++) {
f>>v[i];
}
sort(&v[0],&v[N]);
cif = v[0];
for(i = 0 ; i < N; i++) {
if(v[i] == cif) {
k++;
} else {
if(k > Max) {
Max = k;
sol = cif;
}
k = 1;
cif = v[i];
}
}
g<<sol<<" "<<Max;
}