Cod sursa(job #2400135)
Utilizator | Data | 8 aprilie 2019 13:21:43 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Teme Pregatire ACM Unibuc 2013 | Marime | 0.46 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int v[1000009], n,i,s,x;
int main()
{
f>>n;
for(i=1;i<=n;i++) f>>v[i];
sort(v+1,v+n+1);
x=n/2+1;
for(i=1;i<=n+1;i++){
if(v[i]!=v[i-1]){
if(s>=x){
g<<v[i-1]<<" "<<s;
return 0;
}
s=0;
}
s++;
}
g<<-1;
return 0;
}