zoukankan      html  css  js  c++  java
  • 1129 Recommendation System PAT 甲级真题(输出格式,set使用)

    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
    -----------------------------------
    set<>可以在Node里面重载运算符,注意格式输出。注意重载运算符的方向,
    	#include<iostream>
    	#include<set>
    
    	using namespace std;
    	int n, k;
    	struct Node {
    		int id, cnt;
    		bool operator<(const Node &a)const {
    			return cnt != a.cnt ? cnt > a.cnt:id < a.id;
    		}
    	};
    	int pr[50001];
    	set<Node>ans;
    	int main()
    	{
    		cin >> n >> k;
    		for (int i = 0; i < n; i++) {
    			int u; cin >> u;
    			int tmp = 0;
    			if (i != 0) {
    				printf("%d:", u);
    				for (auto j = ans.begin(); tmp < k&&j != ans.end(); j++, tmp++) {
    					printf(" %d",j->id);
    				}
    				printf("
    ");
    			}
    			auto it = ans.find({u,pr[u]});
    			if (it != ans.end()) ans.erase(it);
    				pr[u]++;
    			ans.insert({ u,pr[u]});
    		}
    		getchar(); getchar();
    		return 0;
    	}
    	
    

      

  • 相关阅读:
    粉丝投稿!从2月份的面试被拒到如今的阿里P7,说一说自己学java以来的经验!
    深入浅出!阿里P7架构师带你分析ArrayList集合源码,建议是先收藏再看!
    简单梳理一下Redis实现分布式Session,建议做java开发的都看看!
    HashMap知识点总结,这一篇算是总结的不错的了,建议看看!
    面试官:小伙子,够了够了,一个工厂模式你都在这说半个小时了!
    iOS-----推送机制(下)
    iOS-----推送机制(上)
    iOS-----使用CoreLocation定位
    iOS-----使用AFNetworking实现网络通信
    iOS-----JSON解析
  • 原文地址:https://www.cnblogs.com/zxzmnh/p/11706819.html
Copyright © 2011-2022 走看看