Cod sursa(job #1671364)
| Utilizator | Data | 1 aprilie 2016 16:42:45 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 60 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include<fstream>
#include<algorithm>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int a[1000005];
int main(){
int n,i,k=0,w;
fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
for(i=1;i<=n;i++){
if(k==0) w=a[i];
if(w==a[i]) k++;
}
if(k==0) fout<<-1;
else{
k=0;
for(i=1;i<=n;i++)
if(w==a[i]) k++;
if(k<n/2+1) fout<<-1;
else fout<<w<<" "<<k;
}
return 0;
}
