PAT甲级1129 Recommendation System (25 分)

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

      题目大意：

     给定长度为n的序列以及推荐系统最大的推荐数k。随后一行给出用户处理的项目流水。

     而推荐的方法如下：如果都完成了同样多次，那么id小的在前，id大的在后，否则完成次数多的在前。输出的形式就是当前正在处理的项目id ： 推荐的项目。

思路：

   用set存储，需要在struct node中重载小于号，node 包含了项目id 和出现次数。我们每次插入都看下set中是否已经存了该项目，如果有，则删除后，重新insert，由此用cnt[id]实时记录他们出现的次数。

参考代码：

 

 

 

#include<set>
#include<cstdio>
using namespace std;
struct node{
	int id, num;
	bool operator < (const node & a) const{
		return num != a.num? num > a.num : id < a.id; 
	}
};
int n, k, cnt[50010];
set<node> ans;
int main(){
	scanf("%d%d", &n, &k);
	for(int i = 0; i < n; ++i){
		int t;
		scanf("%d", &t);
		if(i != 0){
			printf("%d:", t);
			int j = 0;
			for(auto it = ans.begin(); j < k && it != ans.end(); ++it, j++)
				printf(" %d", it->id);
			printf("\n");
		}
		auto it = ans.find({t, cnt[t]});
		if(it != ans.end()) ans.erase(it);
		ans.insert({t, ++cnt[t]});
	}
	return 0;
}

代码参考：https://blog.csdn.net/liuchuo/article/details/68912867