Cod sursa(job #1784867)
| Utilizator | Data | 20 octombrie 2016 16:30:42 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream cin("elmaj.in");
ofstream cout("elmaj.out");
int n;
vector <int> a;
main()
{
cin >> n;
a.resize(n);
for(int i=0; i<n; i++)
{
cin >> a[i];
}
sort(a.begin(),a.end());
int s=0,x=a[n/2];
for (int i=0; i<a.size(); i++)
{
if (a[i]==x) s++;
if (a[i]>x) break;
}
if (s>(n/2)) cout << x << ' ' << s ; else cout << -1;
}
