Pagini recente » Cod sursa (job #161619) | Cod sursa (job #1990031) | Cod sursa (job #1760112) | Cod sursa (job #820751) | Cod sursa (job #3292839)
#include <fstream>
#include <vector>
using namespace std;
int main() {
fstream infile;
infile.open("elmaj.in", fstream::in);
fstream outfile;
outfile.open("elmaj.out", fstream::out);
int n;
infile >> n;
vector<int> numbers(n+1);
int maj = 0, count = 0;
for(int i=0; i<n; ++i) {
infile >> numbers[i];
if (numbers[i] == maj)
++count;
else
--count;
if (count <= 0) {
maj = numbers[i];
count = 1;
}
}
count = 0;
for(int i=0; i<n; ++i)
if(numbers[i] == maj)
++count;
if (count >= (n+1) / 2)
outfile << maj << " " << count << "\n";
else
outfile << "-1\n";
infile.close();
outfile.close();
return 0;
}