1129 Recommendation System (25 分)

Recommendation system predicts the preference that a user would give to an item. Now you are asked to program a very simple recommendation system that rates the user’s preference by the number of times that an item has been accessed by this user.

Input Specification:
Each input file contains one test case. For each test case, the first line contains two positive integers: N (≤ 50,000), the total number of queries, and K (≤ 10), the maximum number of recommendations the system must show to the user. Then given in the second line are the indices of items that the user is accessing – for the sake of simplicity, all the items are indexed from 1 to N. All the numbers in a line are separated by a space.

Output Specification:
For each case, process the queries one by one. Output the recommendations for each query in a line in the format:

query: rec[1] rec[2] … rec[K]
where query is the item that the user is accessing, and rec[i] (i=1, … K) is the i-th item that the system recommends to the user. The first K items that have been accessed most frequently are supposed to be recommended in non-increasing order of their frequencies. If there is a tie, the items will be ordered by their indices in increasing order.

Note: there is no output for the first item since it is impossible to give any recommendation at the time. It is guaranteed to have the output for at least one query.

Sample Input:

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

结尾无空行
Sample Output:

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

结尾无空行

这题如果考试我考，那就是零分，根本读不懂题，看测试样例也看不出来啥意思，最后翻译了一遍还是不太理解，真的吐了。

本题大意是，给定的序列是用户想要点击的产品，在这之前已经点击过一些产品，现在要根据用户点击的次数来推荐一些，从频率高的推荐，如果存在相同频率，就让产品编号递增输出

本题理解切入点：输入 12 个数字，输出 11 行，就是说从第二个数字输入，每输入一个数字，就输出一波推荐的产品

本题使用重载 set 来进行自动排序，定义结构体，并且重载小于号，这样的话在插入 set 的时候能够自动排序，然后定义 book 数组存放点击次数

本题难点：重载 小于号，定义结构体，重写有参的构造方法。

#include<iostream>
#include<bits/stdc++.h>
#include<string>
#include<set>
#include<map>
#include<vector>
#include<queue>
#include<deque>
#include<unordered_set>
#include<unordered_map>
#include<cctype>
#include<algorithm>
#include<stack>
using namespace std;
int book[50001];
struct Node {
	int val;
	int count;
	Node (int a, int b) {
		val = a;
		count = b;
	}
	friend bool operator < (const Node &a, const Node &b) {
		return a.count == b.count ? a.val < b.val : a.count > b.count;
	}
};
int main() {
	int n, m;
	cin >> n >> m;
	set<Node> st;
	for (int i = 0; i < n; i++) {
		int x;
		cin >> x;
		if (i) {
			cout << x << ":";
			int count = 0;
			// 输出推荐的前 k 个产品
			for (auto it = st.begin(); it != st.end() && count < m; it++) {
				cout << " " << it->val;
				count++;
			}
			cout << endl;
		}
		auto it = st.find(Node(x, book[x]));
		if (it != st.end()) {
			st.erase(it);
		}
		book[x]++;//次数增加
		st.insert(Node {x, book[x]});
	}

	return 0;
}