zoukankan      html  css  js  c++  java
  • Printer Queue

    Description

    The only printer in the computer science students' union is experiencing an extremely heavy workload. Sometimes there are a hundred jobs in the printer queue and you may have to wait for hours to get a single page of output. 

    Because some jobs are more important than others, the Hacker General has invented and implemented a simple priority system for the print job queue. Now, each job is assigned a priority between 1 and 9 (with 9 being the highest priority, 
    and 1 being the lowest), and the printer operates as follows.
    • The first job J in queue is taken from the queue.
    • If there is some job in the queue with a higher priority than job J, thenmove J to the end of the queue without printing it.
    • Otherwise, print job J (and do not put it back in the queue).
    In this way, all those importantmuffin recipes that the Hacker General is printing get printed very quickly. Of course, those annoying term papers that others are printing may have to wait for quite some time to get printed, but that's life. 

    Your problem with the new policy is that it has become quite tricky to determine when your print job will actually be completed. You decide to write a program to figure this out. The program will be given the current queue (as a list of priorities) as well as the position of your job in the queue, and must then calculate how long it will take until your job is printed, assuming that no additional jobs will be added to the queue. To simplifymatters, we assume that printing a job always takes exactly one minute, and that adding and removing jobs from the queue is instantaneous.

    Input

    One line with a positive integer: the number of test cases (at most 100). Then for each test case:
    • One line with two integers n and m, where n is the number of jobs in the queue (1 ≤ n ≤ 100) and m is the position of your job (0 ≤ m ≤ n −1). The first position in the queue is number 0, the second is number 1, and so on.
    • One linewith n integers in the range 1 to 9, giving the priorities of the jobs in the queue. The first integer gives the priority of the first job, the second integer the priority of the second job, and so on.

    Output

    For each test case, print one line with a single integer; the number of minutes until your job is completely printed, assuming that no additional print jobs will arrive.

    Sample Input

    3
    1 0
    5
    4 2
    1 2 3 4
    6 0
    1 1 9 1 1 1

    Sample Output

    1
    2
    5

    思路:
    使用队列模拟,不过要自定义一个结构体,方便记录位置。

    #include"iostream"
    #include"cstdio"
    #include"algorithm"
    #include"cstring"
    #include"queue"
    using namespace std;
    const int maxn=110;
    int a[maxn];
    struct node
    {
        int val,pos;
    };
    bool cmp(int c,int d)
    {
        return c>d;
    }
    int main()
    {
        int T,n,m;
        cin>>T;
        while(T--)
        {
            cin>>n>>m;
            queue<node>que;
         for(int i=0;i<n;i++)
         {
             cin>>a[i];
             node ee;
             ee.val=a[i];
             ee.pos=i;
             que.push(ee);
         }
         sort(a,a+n,cmp);
         int ans=1,top=0;
         while(!que.empty())
         {
             node cc;
             cc=que.front();
             que.pop();
             if(cc.val==a[top]&&cc.pos!=m)
             {
                 ans++;
                 top++;
             }
             else
             que.push(cc);
             if(cc.pos==m&&cc.val==a[top])
             {
                 break;
             }
         }
         cout<<ans<<endl;
        }
        return 0;
    }
     
  • 相关阅读:
    9种纯CSS3人物信息卡片动态展示效果
    CSS3 animation属性 实现转动效果
    炫酷CSS3垂直时间轴特效
    css实现翻面效果
    uniapp上传图片转base64码
    经常使用的js三元表达式
    async/await 使用
    Python的OS模块批量修改文件名
    解决Tomcat对POST请求文件上传大小的限制
    HTTP 413错误解决方法
  • 原文地址:https://www.cnblogs.com/zsyacm666666/p/4660373.html
Copyright © 2011-2022 走看看