关注的数据作标记

最新推荐文章于 2024-09-13 17:43:09 发布

我是我是是我是我

最新推荐文章于 2024-09-13 17:43:09 发布

阅读量68

点赞数

分类专栏：笔记文章标签：任务调度优先队列 C++编程算法优化数据结构

本文链接：https://blog.csdn.net/qq_51279492/article/details/120085001

版权

笔记专栏收录该内容

13 篇文章 0 订阅

订阅专栏

uva 12100

#include <iostream>
#include <fstream>
#include <algorithm>
#include <queue>

#define TEST 0

using namespace std;

int main()
{
    ofstream ofs;

    if (TEST)
    {
        ofs.open("/home/lixiaoqi/Documents/Code/C++/1.txt");
        if (!ofs.is_open())
            throw runtime_error("FILE NOT OPEN!");
    }

    ostream &os = TEST ? ofs : cout;

    int n, m, k, pos;
    cin >> m;

    while (m--)
    {
        int time = 0;
        int cnt[10] = {0};
        queue<int> tasks;

        cin >> n >> pos;
        for (int i = 0; i != n; ++i)
        {
            cin >> k;
            cnt[k]++;
            tasks.push(k + (pos == i ? 10 : 0));	
        }

        while (1)
        {

            bool to_back = false;
            for (int i = tasks.front() % 10 + 1; i <= 9; ++i)
                if (cnt[i])
                {
                    to_back = true;
                    break;
                }
            if (!to_back)
            {
                time++;

                if (tasks.front() > 10)
                    break;
                cnt[tasks.front() % 10]--;
            }
            else
                tasks.push(tasks.front());

            tasks.pop();
        }
        os << time << '\n';
    }

    return 0;
}