Cod sursa(job #1915953)
| Utilizator | Data | 8 martie 2017 23:16:04 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <vector>
#include <algorithm>
#include <fstream>
using namespace std;
ifstream cin ("elmaj.in" );
ofstream cout("elmaj.out");
vector <int> a;
int main()
{
int n;
cin >> n;
a.resize(n);
for (int i = 0; i < a.size(); cin >> a[i++] );
sort(a.begin(), a.end());
int x = a[a.size() / 2], y = count(a.begin(), a.end(), x);
if (y > a.size() / 2) cout << x << ' ' << y; else cout << -1;
return 0;
}
