제출 #128790

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
128790		win11905	Cake 3 (JOI19_cake3)	C++11	24 / 100	4067 ms	5912 KiB

cake3

#include <bits/stdc++.h>
#define long long long
#define pii pair<int, int>
#define x first
#define y second
using namespace std;
 
const int N = 1e5+5;
 
int n, m;
vector<pii> vec;
 
int main() {
    scanf("%d %d", &n, &m);
    for(int i = 1, v, c; i <= n; ++i) {
        scanf("%d %d", &v, &c);
        vec.emplace_back(v, c);
    }
    sort(vec.begin(), vec.end(), [&](const pii &a, const pii &b) {
        return a.y < b.y;      
    });
    long ans = -1e18;
    for(int i = 0; i < n; ++i) {
        priority_queue<int, vector<int>, greater<int> > Q;
        long sum = 0;
        for(int j = i; j < n; ++j) {
            sum += vec[j].x, Q.emplace(vec[j].x);
            if(Q.size() > m) sum -= Q.top(), Q.pop();
            if(Q.size() == m) ans = max(ans, sum - 2ll * (vec[j].y - vec[i].y));
        }
    }
    printf("%lld\n", ans);
}

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

cake3.cpp: In function 'int main()':
cake3.cpp:28:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if(Q.size() > m) sum -= Q.top(), Q.pop();
                ~~~~~~~~~^~~
cake3.cpp:29:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if(Q.size() == m) ans = max(ans, sum - 2ll * (vec[j].y - vec[i].y));
                ~~~~~~~~~^~~~
cake3.cpp:14:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n, &m);
     ~~~~~^~~~~~~~~~~~~~~~~
cake3.cpp:16:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", &v, &c);
         ~~~~~^~~~~~~~~~~~~~~~~

• Subtask 1: 5 / 5
• Subtask 2: 19 / 19
• Subtask 3: 0 / 76