Submission #222120

#	Time	Username	Problem	Language	Result	Execution time	Memory
222120		Vimmer	Kisik (COCI19_kisik)	C++14	0 / 90	358 ms	17832 KiB

kisik

#include <bits/stdc++.h>

//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define N 100005
#define MOD ll(998244353)

using namespace std;

typedef long long ll;

typedef long double ld;


int main()
{

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n, k;

    cin >> n >> k;

    pair <ll, ll> a[n];

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

    sort(a, a + n);

    ll sum = 0, mx = 0;

    for (int i = 0; i < n; i++) swap(a[i].F, a[i].S);

    set <pair <ll, int> > se; se.clear();

    for (int i = 0; i < k; i++) {sum += a[i].F; mx = max(mx, a[i].S); se.insert({a[i].F, i}); }

    for (int i = k; i < n; i++)
    {
        pair <ll, int> nm = *se.rbegin();

        se.erase(nm);

        ll len = sum + a[i].F - a[nm.S].F;

        ll hg = a[i].S;

        if (sum * mx > hg * len) {sum = len; mx = hg; se.insert({a[i].F, i}); } else se.insert(nm);
    }

    cout << sum * mx << endl;
}

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