1054. The Dominant Color (20)解题报告

#define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
#include <map>
#include <climits>
using namespace std;

int main(void) {
map<int, int> mp;
map<int, int>::iterator it;
int n, m, i, j, tmp;
scanf("%d %d", &m, &n);
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
scanf("%d", &tmp);
it = mp.find(tmp);
if (it == mp.end()) {
mp[tmp] = 1;
}
else {
it->second++;
}
}
}
it = mp.begin();
int half = m * n / 2;
while (it != mp.end()) {
if (it->second >= half) {
printf("%d\n", it->first);
break;
}
it++;
}

return 0;
}

#define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
#include <map>
#include <climits>
using namespace std;

int main(void) {
int n, m, i, j, tmp, cnt, num;
scanf("%d %d", &m, &n);
cnt = 0;
num = INT_MAX;
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
scanf("%d", &tmp);
}
if (num == tmp) {
cnt++;
}
else {
cnt--;
}
if (cnt <= 0) {
num = tmp;
cnt = 1;
}
}
printf("%d\n", num);
return 0;
}