Pagini recente » Cod sursa (job #2286449) | Cod sursa (job #3142414) | Cod sursa (job #1557158) | Cod sursa (job #1254339) | Cod sursa (job #1331079)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int sir[1000000];
int main(){
int n, i, fr = 0, numar, ap = 0;
fin >> n;
for(i = 0;i < n;i++){
fin >> sir[i];
}
for(i = 0; i < n; i++){
if(sir[i] == sir [i + 1]){
fr++;
numar = sir[i];
}else if(sir[i] != sir[i + 1] && (sir[i] == numar || sir[i + 1] == numar)){
fr--;
}
}
for(i = 0; i < n;i++){
if(sir[i] == numar) ap++;
}
if(fr > 0){
cout << numar << " " << ap;
} else {
cout << "-1";
}
return 0;
}