zoukankan      html  css  js  c++  java
  • CoderForces-913D

    You are preparing for an exam on scheduling theory. The exam will last for exactly Tmilliseconds and will consist of n problems. You can either solve problem i in exactly ti milliseconds or ignore it and spend no time. You don't need time to rest after solving a problem, either.

    Unfortunately, your teacher considers some of the problems too easy for you. Thus, he assigned an integer ai to every problem i meaning that the problem i can bring you a point to the final score only in case you have solved no more than ai problems overall (including problem i).

    Formally, suppose you solve problems p1, p2, ..., pk during the exam. Then, your final score s will be equal to the number of values of j between 1 and k such that k ≤ apj.

    You have guessed that the real first problem of the exam is already in front of you. Therefore, you want to choose a set of problems to solve during the exam maximizing your final score in advance. Don't forget that the exam is limited in time, and you must have enough time to solve all chosen problems. If there exist different sets of problems leading to the maximum final score, any of them will do.

    Input

    The first line contains two integers n and T (1 ≤ n ≤ 2·1051 ≤ T ≤ 109) — the number of problems in the exam and the length of the exam in milliseconds, respectively.

    Each of the next n lines contains two integers ai and ti (1 ≤ ai ≤ n1 ≤ ti ≤ 104). The problems are numbered from 1 to n.

    Output

    In the first line, output a single integer s — your maximum possible final score.

    In the second line, output a single integer k (0 ≤ k ≤ n) — the number of problems you should solve.

    In the third line, output k distinct integers p1, p2, ..., pk (1 ≤ pi ≤ n) — the indexes of problems you should solve, in any order.

    If there are several optimal sets of problems, you may output any of them.

    Example

    Input
    5 300
    3 100
    4 150
    4 80
    2 90
    2 300
    
    Output
    2
    3
    3 1 4
    
    Input
    2 100
    1 787
    2 788
    
    Output
    0
    0
    
    
    Input
    2 100
    2 42
    2 58
    
    Output
    2
    2
    1 2
    

    Note

    In the first example, you should solve problems 3, 1, and 4. In this case you'll spend 80 + 100 + 90 = 270 milliseconds, falling within the length of the exam, 300 milliseconds (and even leaving yourself 30 milliseconds to have a rest). Problems 3 and 1 will bring you a point each, while problem 4 won't. You'll score two points.

    In the second example, the length of the exam is catastrophically not enough to solve even a single problem.

    In the third example, you have just enough time to solve both problems in 42 + 58 = 100milliseconds and hand your solutions to the teacher with a smile.

    题解:

    通过优先队列每次把所有分数为i的元素按照时间从大到下出队列知道队列中只剩下i个元素为止,如果当前SumTime<t && pq.size()==i,则当前解为最优解,。

    AC代码为:

    #include<iostream>
    #include<cstdio>
    #include<queue>
    #include<algorithm>
    using namespace std;
    const int maxn=2e5+10;
    
    
    struct node{
    int lie;
    int ai;
    int time;
    } stu[maxn];
    
    
    bool cmp(node a,node b)
    {
    return a.time < b.time ;
    }
    
    
    struct comp{
    bool operator()(const node a,const node b)
    {
    if(a.ai!=b.ai)
    return a.ai>b.ai;
    return a.time<b.time;
    }
    };
    
    
    priority_queue<node,vector<node>,comp> pq;
    
    
    int main()
    {
    int n,T,cnt=0;
    cin>>n>>T;
    for(int i=0;i<n;i++)
    {
    cin>>stu[i].ai>>stu[i].time;
    stu[i].lie=i+1;
    }
    
    sort(stu,stu+n,cmp);
    
    for(int i=0;i<n;i++)
    {
    if(stu[i].time > T)
    break;
    if(stu[i].ai>cnt)
    {
    T-=stu[i].time;
    pq.push(stu[i]);
    cnt++;
    }
    
    while(!pq.empty() && pq.top().ai<cnt)
    {
    cnt--;
    T+=pq.top().time;
    pq.pop();
    }
    
    }
    
    cout<<cnt<<endl;
    cout<<cnt<<endl;
    
    while(!pq.empty())
    {
    cout<<pq.top().lie<<" ";
    pq.pop();
    }
    cout<<endl;
    
    return 0;
    }
    View Code
  • 相关阅读:
    mysql使用笔记
    js this指向练习题
    for in 和for of的区别
    ES6 Iterator(迭代器或遍历器)和 Generator (生成器)
    vue兄弟之间传值 bus中央事件总线
    关于recycleview 滑动item变长(item变形)问题
    蓝牙篇
    如何限制应用安装,
    网络工具,通过该类可以直接监听网络状态改变
    MyRecycleView带有上拉加载更多
  • 原文地址:https://www.cnblogs.com/csushl/p/9386600.html
Copyright © 2011-2022 走看看