oj.uz

답안 #929857

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
929857 2024-02-18T08:22:49 Z Whisper Kisik (COCI19_kisik) C++17
90 / 90
 247 ms 38632 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for ( int i = a ; i <= b ; i++ )
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define pii pair<int , int>
#define fi first
#define se second
#define Lg(x) 31 - __builtin_clz(x)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)

constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int MAX = 1e6 + 5;
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void setupIO(){
    #define name "Whisper"
    //Phu Trong from Nguyen Tat Thanh High School for gifted student
    srand(time(NULL));
    cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    cout << fixed << setprecision(10);
}

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }

int numHouse, numFamily;
struct Data{
    int width, height;
    bool operator < (const Data& oth) const{
        return height < oth.height;
    }
} a[MAX];

void Whisper(){
    cin >> numHouse >> numFamily;
    for (int i = 1; i <= numHouse; ++i){
        cin >> a[i].width >> a[i].height;
    }
    sort(a + 1, a + numHouse + 1);
    priority_queue<int> q;
    int tot = 0;
    int ans = LINF;
    for (int i = 1; i <= numHouse; ++i){
        while ((int)q.size() >= numFamily) tot -= q.top(), q.pop();
        q.push(a[i].width); tot += a[i].width;
        if ((int)q.size() == numFamily)
            minimize(ans, tot * a[i].height);
    }
    cout << ans;
}


signed main(){
    setupIO();
    int Test = 1;
//    cin >> Test;
    for ( int i = 1 ; i <= Test ; i++ ){
        Whisper();
        if (i < Test) cout << '\n';
    }
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 66 ms 10588 KB Output is correct
2 Correct 174 ms 24804 KB Output is correct
3 Correct 149 ms 27572 KB Output is correct
4 Correct 123 ms 27896 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 121 ms 16504 KB Output is correct
2 Correct 18 ms 4724 KB Output is correct
3 Correct 34 ms 8984 KB Output is correct
4 Correct 113 ms 20704 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 56 ms 10080 KB Output is correct
2 Correct 129 ms 18288 KB Output is correct
3 Correct 109 ms 12904 KB Output is correct
4 Correct 200 ms 38632 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 79 ms 12928 KB Output is correct
2 Correct 247 ms 32460 KB Output is correct
3 Correct 68 ms 10732 KB Output is correct
4 Correct 142 ms 32200 KB Output is correct

Subtask #9
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 191 ms 20604 KB Output is correct
2 Correct 160 ms 23500 KB Output is correct
3 Correct 144 ms 20680 KB Output is correct
4 Correct 72 ms 16356 KB Output is correct