Pagini recente » Cod sursa (job #123672) | Cod sursa (job #1743583) | Cod sursa (job #397084) | Cod sursa (job #101366) | Cod sursa (job #967077)
Cod sursa(job #967077)
#include <iostream>
#include <fstream>
#include <cmath>
#include <vector>
#include <bitset>
#include <queue>
#include <deque>
#include <list>
#include <ctime>
#include <string>
#include <algorithm>
using namespace std;
ifstream ff("elmaj.in");
ofstream gg("elmaj.out");
int n, aa[1000002];
int main(){
ff >> n;
for(int i=0;i<n;i++) ff >> aa[i];
int r=aa[1], k=1;
for(int i=1;i<n;i++)
if(aa[i]==r)k++; else {k--; if(k==0){ r=aa[i+1]; k=1; } }
k=0;
for(int i=0;i<n;i++)
if(aa[i]==r)k++;
if(k>n/2) gg << r << " " << k; else gg << "-1\n";
return 0;
}