Pagini recente » Cod sursa (job #90646) | Cod sursa (job #1319195) | Cod sursa (job #790328) | Cod sursa (job #1000891) | Cod sursa (job #1879464)
#include <fstream>
#include <iostream>
using namespace std;
static long long v[1000000];
int main(){
ifstream f("elmaj.in");
ofstream g("elmaj.out");
long n,i,indic=1,maj=0;
f>>n>>v[0];
maj=v[0];
for(i=1; i<n; i++){
f>>v[i];
if(v[i]!=maj) indic--;
else if(v[i]==maj) indic++;
if(indic==0){
maj=v[i];
indic=1;
}
}
if(indic>0){
indic=0;
for(i=0; i<n; i++)
v[i]==maj ? indic++ : 0;
if(indic>=(n/2+1))
g<<maj<<' '<<indic;
else g<<"-1";
}
else g<<"-1";
f.close();
g.close();
}