PAT 甲级 1129. Recommendation System (25)
来源:互联网 发布:判断微信浏览器 js 编辑:程序博客网 时间:2024/06/08 05:05
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
include
include
include
include
include
using namespace std;
struct node {
int value, cnt;
};
bool cmp(node a, node b) {
if (a.cnt != b.cnt)
return a.cnt > b.cnt;
else
return a.value < b.value;
}
int main() {
int n, m;
scanf(“%d%d”, &n, &m);
vector v(n );
for (int i =0; i < n; i++) {
v[i].value = i+1;
v[i].cnt = 0;
}
for (int i = 0; i < n; i++) {
int t;
scanf(“%d”, &t);
sort(v.begin(), v.end(), cmp);
if (i != 0) {
cout << t << “:”;
for (int j = 0; j < m; j++) {
if (v[j].cnt != 0)
cout << ” ” << v[j].value;
}
cout << endl;
}
for (int j = 0; j < n; j++) {
if (v[j].value == t) {
v[j].cnt++;
}
}
}cin >> n;return 0;
}
- PAT甲级 1129. Recommendation System (25)
- PAT 甲级 1129. Recommendation System (25)
- PAT 1129. Recommendation System (25)
- PAT--1129. Recommendation System
- PAT 1129. Recommendation System (25) 数数
- 【PAT】【Advanced Level】1129. Recommendation System (25)
- PAT(A)-1129. Recommendation System (25)(优先队列)
- pat 1129. Recommendation System (25)(set的增删)
- 1129. Recommendation System (25)
- 1129. Recommendation System (25)
- 1129. Recommendation System (25)
- 1129. Recommendation System (25)
- 1129. Recommendation System (25)
- 1129. Recommendation System (25)
- 1129. Recommendation System (25)
- PAT 1129Recommendation System
- 1129. Recommendation System (25) set
- PAT 1129. Recommendation System (25) 优先队列--维持前k个最大堆
- Spring MVC 跨域
- Java day8
- 策略模式
- Java 常用工具类 Collections 源码分析
- OpenShift Origin v3.7 端口转发
- PAT 甲级 1129. Recommendation System (25)
- ubuntu(16.04) 系统相互在root下免密ssh
- android的传参
- PAT 甲级 1130. Infix Expression (25)
- 工作总结
- CSDN-MARKDOWN flowchart.js 流程图详解
- Webpack中 publicPath 跟 path 的区别,个人理解
- CMake找不到opencv库解决办法
- 自动生成简单数学题的小程序范例