Cod sursa(job #3038337)
Utilizator | Data | 27 martie 2023 11:26:31 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int n,v[1000001];
int main(){
fin>>n;
for(int i=1;i<=n;i++)
fin>>v[i];
sort(v+1,v+n+1);
int rez=0;
int i=1;
while(i<=n){
int ap=1;
while(v[i]==v[i+1])
ap++,i++;
if(ap>=n/2+1)
{fout<<v[i]<<" "<<ap; rez=1; break;}
else
i++;
}
if(rez==0)
fout<<-1;
return 0;
}