【剑指紫金港】1129 Recommendation System Set妙用

A 1129 Recommendation System

题目链接

Problem Description

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

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

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 queryis 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个号码，如果点击次数一样多，输出号码更小的那个。

解题思路：

stl和结构体的运用，没什么算法技巧，看代码总结学习。

AC代码

#include<bits/stdc++.h>
using namespace std;
const int maxn = 50005;
struct node{
    int v,num;
    bool operator<(const node &a) const{
        return num!=a.num ? num>a.num : v<a.v;
    }
};
int rec[maxn],m,n,k;
set<node>magic;
int main(){
    scanf("%d%d",&n,&k);
    for(int i=0;i<n;i++){
        scanf("%d",&m);
        rec[m]++;
        if(i==0){
            magic.insert({m,rec[m]});
            continue;
        }
        printf("%d:",m);
        int cnt=0;
        for(auto it=magic.begin();it!=magic.end() && cnt<k;it++){
            printf(" %d",*it);
            cnt++;
        }
        auto it = magic.find({m,rec[m]-1});
        if(it!=magic.end()){
            magic.erase(it);
        }
        magic.insert({m,rec[m]});
        printf("\n");
    }
    return 0;
}