제출 #748778

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
748778		jamielim	Hiring (IOI09_hiring)	C++14	100 / 100	307 ms	15876 KiB

hiring

#include <bits/stdc++.h>
using namespace std;

int n;
long long w;
pair<pair<double,int>,int> p[500005];

int main() {
    scanf("%d%lld",&n,&w);
    int s,q;
    for(int i=0;i<n;i++){
        scanf("%d%d",&s,&q);
        p[i].first=make_pair((double)s/(double)q,q);
        p[i].second=i+1;
    }
    sort(p,p+n);
    int ans=0;
    priority_queue<int> pq;
    long long sum=0;
    double price=w;
    for(int i=0;i<n;i++){
        sum+=p[i].first.second;
        pq.push(p[i].first.second);
        double v=p[i].first.first;
        while(!pq.empty()&&sum>w/v){
            sum-=pq.top();
            pq.pop();
        }
        if(ans<(int)pq.size()){
            ans=(int)pq.size();
            price=sum*v;
        }else if(ans==(int)pq.size()){
            price=min(price,sum*v);
        }
    }
    printf("%d\n",ans);
    sum=0;
    priority_queue<pair<int,int> > pq2;
    for(int i=0;i<n;i++){
        sum+=p[i].first.second;
        pq2.push(make_pair(p[i].first.second,p[i].second));
        double v=p[i].first.first;
        while(!pq2.empty()&&sum>w/v){
            sum-=pq2.top().first;
            pq2.pop();
        }
        //printf("%d %d %f %f\n",ans,(int)pq2.size(),price,sum*v);
        if(ans==(int)pq2.size()&&abs(price-sum*v)<1e-8){
            while(!pq2.empty()){
                printf("%d\n",pq2.top().second);
                pq2.pop();
            }
            break;
        }
    }
}

컴파일 시 표준 에러 (stderr) 메시지

hiring.cpp: In function 'int main()':
hiring.cpp:9:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    9 |     scanf("%d%lld",&n,&w);
      |     ~~~~~^~~~~~~~~~~~~~~~
hiring.cpp:12:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |         scanf("%d%d",&s,&q);
      |         ~~~~~^~~~~~~~~~~~~~

• Subtask 1: 30 / 30
• Subtask 2: 28 / 28
• Subtask 3: 6 / 6
• Subtask 4: 6 / 6
• Subtask 5: 6 / 6
• Subtask 6: 6 / 6
• Subtask 7: 6 / 6
• Subtask 8: 6 / 6
• Subtask 9: 6 / 6