Cod sursa(job #2788036)
Utilizator | ene dumitru enedumitru | Data | 24 octombrie 2021 19:08:07 |
---|---|---|---|
Problema | Elementul majoritar | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("elmaj.in"); ofstream g("elmaj.out");
int n,v[1000001];
int main()
{ f>>n;
for(int i=1;i<=n;i++) f>>v[i];
sort(v+1,v+n+1);
for(int i=1;i<=n;++i)
{ int j=i;
while(j<=n && v[i]==v[j+1]) j++;
if(j-i+1>n/2) {g<<v[i]<<' '<<j-i+1; g.close(); f.close(); return 0;}
}
g<<-1; g.close(); f.close(); return 0;
}