Cod sursa(job #3243425)
Utilizator | Data | 18 septembrie 2024 17:22:16 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 60 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream cin("elmaj.in");
ofstream cout("elmaj.out");
int n, v[100005], cnt;
int main()
{
cin >> n;
for(int i=1; i<=n; i++)
cin >> v[i];
sort(v+1, v+n+1);
int k = v[n/2];
for(int i=1; i<=n; i++)
if(v[i] == k)
cnt++;
if(cnt >= n/2+1)
cout << k << " " <<cnt;
else
cout << "-1";
return 0;
}