oj.uz

답안 #222111

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
222111 2020-04-12T06:49:32 Z NONAME Kisik (COCI19_kisik) C++17
90 / 90
 395 ms 31168 KB 
#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.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 416 KB Output is correct
3 Correct 5 ms 408 KB Output is correct
4 Correct 4 ms 384 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 119 ms 8672 KB Output is correct
2 Correct 283 ms 16936 KB Output is correct
3 Correct 232 ms 22592 KB Output is correct
4 Correct 214 ms 21444 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 203 ms 10072 KB Output is correct
2 Correct 31 ms 3188 KB Output is correct
3 Correct 64 ms 5984 KB Output is correct
4 Correct 177 ms 15700 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 102 ms 7976 KB Output is correct
2 Correct 220 ms 16980 KB Output is correct
3 Correct 166 ms 8672 KB Output is correct
4 Correct 373 ms 31168 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 134 ms 8672 KB Output is correct
2 Correct 395 ms 22208 KB Output is correct
3 Correct 116 ms 8672 KB Output is correct
4 Correct 253 ms 24472 KB Output is correct

Subtask #9
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 294 ms 16952 KB Output is correct
2 Correct 256 ms 17728 KB Output is correct
3 Correct 201 ms 14420 KB Output is correct
4 Correct 121 ms 11864 KB Output is correct