# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1080068 | serifefedartar | Akcija (COCI21_akcija) | C++17 | 5008 ms | 24584 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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<set<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<set<int>>(n+1, set<int>());
dp[0].insert(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].insert(Q + u.s);
if (dp[i+1].size() > k)
dp[i+1].erase(prev(dp[i+1].end()));
}
}
}
for (int i = n; k && i >= 0; i--) {
while (k && dp[i].size()) {
cout << i << " " << *(dp[i].begin()) << "\n";
k--;
dp[i].erase(dp[i].begin());
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |