1054 The Dominant Color (20)（20 分）

Behind the scenes in the computer's memory, color is always talked about as a series of 24 bits of information for each pixel. In an image, the color with the largest proportional area is called the dominant color. A strictly dominant color takes more than half of the total area. Now given an image of resolution M by N (for example, 800x600), you are supposed to point out the strictly dominant color.

Input Specification:

Each input file contains one test case. For each case, the first line contains 2 positive numbers: M (<=800) and N (<=600) which are the resolutions of the image. Then N lines follow, each contains M digital colors in the range [0, 2^24^). It is guaranteed that the strictly dominant color exists for each input image. All the numbers in a line are separated by a space.

Output Specification:

For each test case, simply print the dominant color in a line.

Sample Input:

5 3
0 0 255 16777215 24
24 24 0 0 24
24 0 24 24 24

Sample Output:

24

实测这个方法的却是最快的：

还有就是，超时了把cin改为scanf

#include<iostream>
#include<map>
using namespace std;

int main() {
	//while (1) {

	int n, m;
	scanf("%d%d", &n, &m);
	int x, half = m*n;
	half /= 2;
	map<int, int> a;
	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < m; ++j) {
			scanf("%d",&x);
			if (a.find(x) != a.end()) {
				++a[x];
			}
			else {
				a[x] = 1;
			}
		}
	}

	map<int, int>::iterator li;
	for (li = a.begin(); li != a.end(); ++li) {
			if (li->second > half) {
				printf("%d", li->first);
				return 0;
			}
		
	}

	//}


}

下面的方法超时：

#include<iostream>
#include<set>
using namespace std;

int main() {
	//while (1) {

	int n, m;
	scanf("%d%d", &n, &m);
	int x, half = m*n;
	half /= 2;
	multiset<int> a;
	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < m; ++j) {
			scanf("%d",&x);
			a.insert(x);
		}
	}
	while (a.begin() != a.end()) {
		if (a.count(*a.begin()) > half) {
			cout << *a.begin();
			return 0;
		}
		else {
			a.erase(*a.begin());
		}
	}


	
	//}


}