Submission #1080063

#	Time	Username	Problem	Language	Result	Execution time	Memory
1080063		serifefedartar	Akcija (COCI21_akcija)	C++17	10 / 110	463 ms	524288 KiB

Main

#include <bits/stdc++.h>
using namespace std;

#define fast ios::sync_with_stdio(0);cin.tie(0)
typedef long long ll;
#define f first
#define s second
#define LOGN 21
const ll MOD = 1e9 + 7;
const ll MAXN = 150;

#define int long long
vector<pair<int,int>> v;
vector<vector<int>> dp;

signed main() {
    fast;
    int n, k;
    cin >> n >> k;

    v = vector<pair<int,int>>(n);
    for (int i = 0; i < n; i++)
        cin >> v[i].s >> v[i].f;
    sort(v.begin(), v.end());

    dp = vector<vector<int>>(n+1, vector<int>());
    dp[0].push_back(0);
    for (auto u : v) {
        for (int i = n; i >= 0; i--) {
            if (i+1 > u.f)
                continue;
            for (auto Q : dp[i])
                dp[i + 1].push_back(Q + u.s);
        }
    }

    for (int i = n; k && i >= 0; i--) {
        sort(dp[i].begin(), dp[i].end(), greater<int>());
        while (k && dp[i].size()) {
            cout << i << " " << dp[i].back() << "\n";
            k--;
            dp[i].pop_back();
        }
    }
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 10 / 10
• Subtask 5: 0 / 30
• Subtask 6: 0 / 20