제출 #147478

#제출 시각아이디문제언어결과실행 시간메모리
147478willi19휴가 (IOI14_holiday)C++14
23 / 100
45 ms5628 KiB
#include<holiday.h>
#include<bits/stdc++.h>
using namespace std;
long long int findMaxAttraction(int n, int start, int d, int attraction[]) {
    multiset<long long> s;
    long long ret=0;
    for(int i=0;i<(d+1)/2&&start<n;i++,start++)
    {
        s.insert(attraction[start]);
        ret+=attraction[start];
    }
    long long state=ret;
    d=d/2;
    while(start<n&&d>0)
    {
        s.insert(attraction[start]);
        state+=attraction[start];
        while(s.size()>d)
        {
            state-=*(s.begin());
            s.erase(s.begin());
        }
        ret=max(ret,state);
        start++;
        d--;
    }
    return ret;
}

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

holiday.cpp: In function 'long long int findMaxAttraction(int, int, int, int*)':
holiday.cpp:18:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while(s.size()>d)
               ~~~~~~~~^~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...