Cod sursa(job #3181348)
Utilizator | Data | 6 decembrie 2023 21:25:53 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int n,cnt;
long long v[1000001];
int main()
{ fin>>n;
for(int i=1;i<=n;i++)
fin>>v[i];
sort(v,v+n+1);
for(int i=1;i<n-1;i++)
{ int k=i;
while(v[k]==v[k+1] && k<n)
{cnt++;
k++;
}
if(cnt>n/2+1)
{fout<<v[i]<<' '<<cnt-1;
break;
}
}
return 0;
}