Submission #222111

#	Time	Username	Problem	Language	Result	Execution time	Memory
222111		NONAME	Kisik (COCI19_kisik)	C++17	90 / 90	395 ms	31168 KiB

kisik

#include <bits/stdc++.h>
#include <time.h>
//#include <random>
#define sz(x) int(x.size())
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#define N 100500
#define oo ll(1e16)
#define pii pair <int, int>
#define pll pair <ll, ll>
#define ft first
#define sd second
#define pb push_back
#define ppb pop_back
#define el '\n'
#define elf endl
#define base ll(1e9 + 7)
#define re return
#define nins 4294967295
using namespace std;
typedef long long ll;
typedef long double ld;

//mt19937 rnd(0);

ll n, k;
vector <pll> v;
priority_queue <ll> q;

void solve() {
    cin >> n >> k;
    for (int i = 0; i < n; i++) {
        ll x, y; cin >> x >> y;

        v.pb({x, y});
    }

    for (int i = 0; i < n; i++)
        swap(v[i].ft, v[i].sd);

    sort(v.begin(), v.end());

    for (int i = 0; i < n; i++)
        swap(v[i].ft, v[i].sd);

    ll ans = oo * 100ll, sum = 0;

    for (int i = 0; i < n; i++) {
        q.push(v[i].ft);
        sum += v[i].ft;

        if (sz(q) < k)
            continue;

        if (sz(q) > k) {
            sum -= q.top();
            q.pop();
        }

        ans = min(ans, sum * v[i].sd);
    }

    cout << ans;
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    #ifdef _LOCAL
        in("input.txt");

        int t = 1;
//        cin >> t;
        for (int i = 1; i <= t; i++) {
            cout << "Test #" << i << elf;

            clock_t start_time = clock();

            solve();

            cerr.precision(4); cerr << fixed;
            cerr << elf;
            cerr << "Time :: " << ld(clock() - start_time) / CLOCKS_PER_SEC << elf;

            cout << elf;
        }
    #else
        int t = 1;
//        cin >> t;

        while (t--) {
            solve();
            cout << el;
        }
    #endif
}

• 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