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 all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define bpc(x) __builtin_popcount(x)
#define bpcll(x) __builtin_popcountll(x)
#define MP make_pair
#define BIT(x, i) (((x) >> (i)) & 1)
//#define endl '\n'
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
typedef long long ll;
const int MOD = 1e9 + 7;
const int N = 1e6 + 3e2;
pair<int, int> p[N];
multiset<pair<int, ll>> best[N];
void solve(){
    int n, k;
    cin >> n >> k;
    function<void(int, int, ll)> add = [&](int i, int x, ll y){
        y = -y;
        if (best[i].size() < k){
            best[i].emplace(x, y);
        } else if (*best[i].begin() < MP(x, y)){
            best[i].erase(best[i].begin());
            best[i].emplace(x, y);
        }
    };
    add(0, 0, 0);
    for (int i = 1; i <= n; i++) cin >> p[i].first >> p[i].second;
    sort(p + 1, p + n + 1, [](auto x, auto y){
        return x.second < y.second;
    });
    for (int i = 1; i <= n; i++) {
        auto [w, d] = p[i];
        for (int j = 0; j < i; j++) {
            multiset<pair<int, ll>> s = best[j];
            for (auto [x, y]: s) {
                y = -y;
                if (x < d) add(i, x + 1, y + w);
            }
        }
    }
    multiset<pair<int, ll>> s;
    for (int i = 0; i <= n; i++){
        s.insert(all(best[i]));
    }
    for (auto it = s.rbegin(); it != s.rend(); it++){
        if (k-- == 0) break;
        cout << it->first << ' ' << -it->second << endl;
    }
}
int main(){
    clock_t startTime = clock();
    ios_base::sync_with_stdio(false);
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    int test_cases = 1;
//    cin >> test_cases;
    for (int test = 1; test <= test_cases; test++){
        // cout << (solve() ? "YES" : "NO") << endl;
        solve();
    }
#ifdef LOCAL
    cerr << "Time: " << int((double) (clock() - startTime) / CLOCKS_PER_SEC * 1000) << " ms" << endl;
#endif
    return 0;
}
Compilation message (stderr)
Main.cpp: In lambda function:
Main.cpp:28:28: warning: comparison of integer expressions of different signedness: 'std::multiset<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   28 |         if (best[i].size() < k){
      |             ~~~~~~~~~~~~~~~^~~
Main.cpp: In function 'int main()':
Main.cpp:68:13: warning: unused variable 'startTime' [-Wunused-variable]
   68 |     clock_t startTime = clock();
      |             ^~~~~~~~~| # | 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... |