Submission #222098

#	Time	Username	Problem	Language	Result	Execution time	Memory
222098		VEGAnn	Kisik (COCI19_kisik)	C++14	90 / 90	371 ms	24988 KiB

kisik

#include <bits/stdc++.h>
#define pii pair<int,int>
#define ft first
#define sd second
using namespace std;
typedef long long ll;
const int N = 1000100;
const ll OO = 1e18;
priority_queue<int> st;
pii a[N];
int n, k;
ll sm = 0ll, ans = OO;

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);

//    freopen("in.txt","r",stdin);

    cin >> n >> k;

    for (int i = 0; i < n; i++)
        cin >> a[i].sd >> a[i].ft;

    sort(a, a + n);

    for (int i = 0; i < n; i++){
        st.push(a[i].sd);
        sm += a[i].sd;

        if (i >= k){
            sm -= st.top();
            st.pop();
        }

        if (i + 1 >= k)
            ans = min(ans, ll(a[i].ft) * sm);
    }

    cout << ans;

    return 0;
}

• 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