1129. Recommendation System (25)

题目不难，注意别全部排序，这样会超时

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
    int N, K;
    cin >> N >> K;
    int visited[100000];
    vector<int> all;
    int x;
    cin >> x;
    visited[x]++;
    all.push_back(x);
    while (--N)
    {
        cin >> x;
        printf("%d:", x);
        for (auto x : all)
            printf(" %d", x);
        putchar('\n');
        visited[x]++;
        int tt = find(all.begin(), all.end(), x) - all.begin();
        if (tt >= all.size()) { all.push_back(x); tt = all.size() - 1; }
        for (int t = tt-1;t >= 0;t--)
        {
            if (visited[x] > visited[all[t]] || (visited[x] == visited[all[t]] && x < all[t]))
            {
                all[t + 1] = all[t];
                all[t] = x;
            }
        }
        if (all.size() > K) all.pop_back();
    }
}