Cod sursa(job #1326234)
| Utilizator | Data | 24 ianuarie 2015 22:35:14 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream in ("elmaj.in");
ofstream out ("elmaj.out");
int main(){
int n,i,x;
in>>n;
vector <int> V;
int X=0,ap=0,j;
for (i=0;i<n;i++)
{in>>x;
V.push_back(x);}
sort(V.begin(),V.end());
for (i=0;i<n;i++){
int nr=1;
for (j=i+1;j<n;j++){
if (V[j]==V[i])
nr++;}
if (nr>=n/2+1){
X=V[i];
ap=nr;
break;}
}
if (X){
out<<X<<" "<<ap;
}
else out<<-1;
return 0;
}
