Cod sursa(job #709317)
| Utilizator | Data | 7 martie 2012 23:02:41 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int n, v[1000010];
int main() {
int i, p, k = 0, lastElem;
fin >> n;
for(i = 1; i <= n; ++i)
fin >> v[i];
for(i = 1; i <= n; ++i)
if(k == 0) {
k = 1;
lastElem = v[i];
}
else if(lastElem == v[i])
++k;
else
--k;
for(i = 1; i <= n; ++i)
if(v[i] == lastElem)
++p;
fout << p << " " << lastElem << "\n";
fout.close();
return 0;
}
