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
题目大意:用户点击一个编号,让你根据以前的点击编号频度给出一组推荐编号,最多推荐k个编号,点击次数多的靠前。如果存在两个记录点击次数相同,则输出编号小的那个。
分析:如果能找到一个容器把之前的记录存起来,且可以按频度降序排列,频度相同按编号大小升序排序那就好了。那么只需要对set进行重载即可。
核心代码:
struct node{
int num,cnt;
bool operator < (const node &a)const{ // < 运算符重载
return cnt!=a.cnt? cnt>a.cnt:num<a.num;
}
};
完整代码:
#include<bits/stdc++.h>
using namespace std;
struct node{
int num,cnt;
bool operator < (const node &a)const{
return cnt!=a.cnt? cnt>a.cnt:num<a.num;
}
};
int times[50010];
int main(){
int n,k,temp;
cin>>n>>k;
set<node>s;
for(int i=0;i<n;i++){
cin>>temp;
if(i){
cout<<temp<<":";
int cnt=0;
for(auto it=s.begin();it!=s.end() && cnt<k;it++){
printf(" %d",*it);
cnt++;
}
cout<<endl;
}//若s集合中找到,则删除
// for(auto it=s.find(node{temp,times[temp]});it!=s.end();it++)
// s.erase(it);//s.find()已经遍历容器查找了,不能在 it++ 了
auto it=s.find(node{temp,times[temp]});
if(it!=s.end()) s.erase(it);
//刷新temp的次数,重新插入节点
times[temp]++;
s.insert(node{temp,times[temp]});
}
return 0;
}
That‘s all !