Pagini recente » Cod sursa (job #2081251) | Cod sursa (job #366995) | Cod sursa (job #342213) | Cod sursa (job #1185664) | Cod sursa (job #1312074)
#include<fstream>
#include<vector>
#include<algorithm>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int n, cur, cand, ap;
int main() {
fin>>n;
for(int i=1; i<=n; i++) {
fin>>cur;
if(cur != cand) {
ap--;
if(ap == -1) {
cur = cand;
ap = 0;
}
} else {
ap++;
}
}
fin.close();
ifstream fin("elmaj.in");
fin>>n>>cand;
ap = 1;
int poz;
for(int i=2; i<=n; i++) {
fin>>cur;
if(cur == cand) {
ap++;
}
}
if(ap > n/2) fout<<cand<<" "<<ap;
else fout<<-1;
return 0;
}