1129 Recommendation System (25分)测试点5

如果测试点5没过，那么你一定是忽略了一个问题：
如果前K个数值都相同的情况，例如：

12 3
3 3 3 5 5 3 2 1 8 3 8 12

正确输出：

3: 3
3: 3
5: 3
5: 3 5
3: 3 5
2: 3 5
1: 3 5 2
8: 3 5 1
3: 3 5 1
8: 3 5 1
12: 3 5 8

附本人AC代码：

#include<vector>
#include<iostream>
#include<map>
#include<set>
#include<algorithm>
using namespace std;
struct Node {
	int val, num=0;
};
vector<Node>T(50011), ans;
bool cmp(Node&A, Node&B) {
	return A.num == B.num ? A.val < B.val : A.num>B.num;
}
int main() {
	int N, M, val;
	scanf("%d%d", &N, &M);
	for (int i = 0; i < 50010; i++)T[i].val = i;
	for (int i = 0; i < N; i++) {
		scanf("%d", &val);
		if (i != 0) {
			printf("%d:", val);
			sort(ans.begin(), ans.end(), cmp);
			for (int i = 0; i < ans.size(); i++) {
				printf(" %d", ans[i].val);
			}
			printf("\n");
		}
		T[val].num++;
		if (ans.size()<M) {
			int tag = 0;
			for (int j = 0; j < ans.size(); j++) {
				if (ans[j].val == val) {
					ans[j].num++;
					tag = 1;
				}
			}
			if(tag==0)ans.push_back({ val,T[val].num });
		}
		else {
			int tm = 0, tag = 0;
			for (; tm < ans.size(); tm++) {
				if (ans[tm].val == val) {
					ans[tm].num++;
					tag = 1;
					break;
				}
			}
			if (tag == 1)continue;
			sort(ans.begin(), ans.end(), cmp);
			if (ans[ans.size() - 1].num == T[val].num&&val<ans[ans.size()-1].val) {
				ans[ans.size() - 1].val = val;
			}
			else if (T[val].num > ans[ans.size() - 1].num) {
				ans[ans.size() - 1].num = T[val].num;
				ans[ans.size() - 1].val = val;
			}
		}
	}
	return 0;
}