Submission #120403

#	Time	Username	Problem	Language	Result	Execution time	Memory
120403		FutymyClone	Kisik (COCI19_kisik)	C++14	90 / 90	1620 ms	65600 KiB

kisik

#include <bits/stdc++.h>

using namespace std;

const int N = 1e6 + 5;

multiset <int> widths;
int n, k;

struct Item {
    int w, h;
    bool operator < (const Item &rhs) const {
        if (h != rhs.h) return h < rhs.h;
        return w < rhs.w;
    }
} a[N];

int main(){
    scanf("%d %d", &n, &k);
    for (int i = 1; i <= n; i++) scanf("%d %d", &a[i].w, &a[i].h);
    sort(a + 1, a + n + 1);
    long long ans = 9e18;

    int ptr = 1;
    long long sum = 0;
    for (int i = 1; i <= n; i = ptr) {
        while (ptr <= n && a[ptr].h == a[i].h) widths.insert(a[ptr].w), sum += a[ptr].w, ptr++;
        if (widths.size() >= k) {
            while (widths.size() > k) {
                int val = *widths.rbegin();
                sum -= val;
                widths.erase(widths.find(val));
            }

            ans = min(ans, 1LL * sum * a[i].h);
        }
    }

    printf("%lld", ans);
    return 0;
}

Compilation message (stderr)

kisik.cpp: In function 'int main()':
kisik.cpp:28:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if (widths.size() >= k) {
             ~~~~~~~~~~~~~~^~~~
kisik.cpp:29:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             while (widths.size() > k) {
                    ~~~~~~~~~~~~~~^~~
kisik.cpp:19:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n, &k);
     ~~~~~^~~~~~~~~~~~~~~~~
kisik.cpp:20:39: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for (int i = 1; i <= n; i++) scanf("%d %d", &a[i].w, &a[i].h);
                                  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

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