Cod sursa(job #2616491)
| Utilizator | Data | 18 mai 2020 18:21:27 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Teme Pregatire ACM Unibuc 2013 | Marime | 0.6 kb |
#include <fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int v[1000005];
int main() {
int n, x, app=1;
f>>n>>v[0];
x=v[0];
for (int i=1; i<n; i++) {
f>>v[i];
if(x==v[i]){
app++;
}
else{
app--;
}
if (app==0){
app=1;
x=v[i];
}
}
app=0;
for (int i=0; i<n; i++){
if (x==v[i]){
app++;
}
}
if (app>=n/2+1){
g<<x<<" "<<app;
}
else{
g<<"-1";
}
return 0;
}
