# 1129. Recommendation System (25)

400 ms

65536 kB

16000 B

Standard

CHEN, Yue

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 (<= 50000), 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

#### c++代码：

#include<bits/stdc++.h>
using namespace std;
struct T{//商品类
int indice=0,frequency=0;//商品编号、商品购买次数
T(int i,int f):indice(i),frequency(f){}//构造函数
bool operator <(const T&t)const{//重载小于运算符
return this->frequency!=t.frequency?this->frequency>t.frequency:this->indice<t.indice;
}
};
int m[50005];//存储物品购买次数
set<T>s;
int main(){
int N,K,a;
scanf("%d%d%d",&N,&K,&a);
s.insert(T(a,1));//将第一个物品压入s中
++m[a];//递增第一个物品购买次数
for(int i=2;i<=N;++i){
scanf("%d",&a);
printf("%d: ",a);
int k=0;
for(auto i=s.cbegin();i!=s.cend()&&k<K;++i){//输出s中前K个物品
printf("%s%d",i!=s.cbegin()?" ":"",i->indice);
++k;
}
printf("\n");
auto it=s.find(T(a,m[a]));
if(it!=s.end())//查找s中是否含当前物品，如果包含，则进行删除
s.erase(it);
s.insert(T(a,++m[a]));//将更新后的商品及其购买次数压入s
}
return 0;
}

• 擅长领域：
• 算法