Pagini recente » Cod sursa (job #1562530) | Cod sursa (job #3218527) | Cod sursa (job #1482435) | Cod sursa (job #1712590) | Cod sursa (job #1546390)
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n;
f >> n;
vector<int> v(n);
for(auto& x : v){
f >> x; }
int cur = 0, nr = 0;
for(int i = 0; i < n; ++i){
if(cur == v[i]){
++nr; }
else if(nr != 0){
--nr; }
else{
cur = v[i], nr = 1; } }
int cnt = count(begin(v), end(v), cur);
if(cnt >= n/2+1){
g << cur << ' ' << cnt; }
else{
g << -1; }
return 0; }