【题解】【PAT甲】 1129 Recommendation System (25 分)（set重构）

题目链接

 PTA | 程序设计类实验辅助教学平台

题目描述

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

题目大意

 给你一个数组，当遍历到元素v[i]的时候，你需要输出k位前面的元素

规则为当按照前i-1个元素出现的次数由大到小排序，如果出现的次数相同，则按照数字的大小从大到小输出

解题思路

 一开始自己写了一遍超时了两个时间点，然后参考了一下柳婼的代码

PAT 1129. Recommendation System (25) 甲级_柳婼 の blog-CSDN博客

发现是用结构体set，用set自动排序的方法来对前i-1个元素按照规则排序

用法参考一下自己写的博客

https://blog.csdn.net/Elephant_King/article/details/121750565

注意每次输出一个元素需要将这个元素删除之后让cnt+1后再放入set，否则就会导致可能出现

val   5   5   5
cnt   5   4   3

这种情况 

题解

#include<bits/stdc++.h>
using namespace std;
map<int,int> ma;
struct Node{
	int val;
	int cnt;
	bool operator < (const Node a)const{
		return a.cnt==cnt?val<a.val:cnt>a.cnt;
	}
};
int main(){
	set<Node> s;
	int n,k;
	cin>>n>>k;
	int data;
	for(int i=0;i<n;i++){
		scanf("%d",&data);
		if(i!=0){
			printf("%d:",data);
			int cnt=0;
			for(auto it=s.begin();it!=s.end()&&cnt<k;it++,cnt++){
				printf(" %d",it->val);
			}
			printf("\n");
		}
		if(s.find(Node{data,ma[data]})!=s.end())	
			s.erase(s.find(Node{data,ma[data]}));
		ma[data]++;
		s.insert(Node{data,ma[data]});
	}
}