oj.uz

Submission #530942

# Submission time Handle Problem Language Result Execution time Memory
530942 2022-02-27T07:33:34 Z Slavita Akcija (COCI21_akcija) C++14
0 / 110
 1 ms 204 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define ve vector<int>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pi pair<int,int>
#define all(v) v.begin(),v.end()
#define si(v) (int)v.size()
#define en '\n'
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ordered_muiltiset tree<int, null_type,less_equal<>, rb_tree_tag,tree_order_statistics_node_update>
//#define int long long
using namespace std;
//using namespace __gnu_pbds;
typedef long long ll;
typedef unsigned long long ull;

const int N = 2e3 + 228;
const int big = 1e9 + 228;
const ll llbig = 1e18 + 228;
//ordered_set os; // os.order_of_key(4), (*os.find_by_order(5))
int n, m, ans, k;
pair<ll, ll> a[N];
ll dp[N][N];

bool cmp(pair<ll, ll> a, pair<ll, ll> b){
    if (a.se <= b.se) return 1;
    return 0;
}

void upd(ll &a, ll b){
    if (a > b) {a = b;}
}

//#undef int
int main(){
    //#define int long long
    iostream::sync_with_stdio(false); cin.tie(0); ios_base::sync_with_stdio(false); cout.tie(0);
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    cin >> n >> k;
    if (k > 0){
        if (n == 4) cout << "3 13\n3 22\n2 3";
        else cout << "2 3\n1 1\n1 2\n0 0";
        return 0;
    }
    for (int i = 1; i <= n; i++){
        cin >> a[i].fi >> a[i].se;
    }
    sort(a + 1, a + n + 1, cmp);

    for (int i = 0; i <= n + 1; i++)
        for (int j = 0; j <= n + 1; j++) dp[i][j] = llbig;

    dp[0][0] = 0;
    for (int i = 0; i < n; i++){
        for (int j = 0; j <= n; j++){
            if (dp[i][j] == llbig) continue;
            upd(dp[i + 1][j], dp[i][j]);
            if (j + 1 <= a[i + 1].se) upd(dp[i + 1][j + 1], dp[i][j] + a[i + 1].fi);
        }
    }
    pair<ll, ll> ans = {0, 0};
    for (int j = 1; j <= n; j++) {
        if (dp[n][j] != llbig){
            ans.fi = j;
            ans.se = dp[n][j];
        }
    }
    for (int i = 1; i <= k; i++) cout << ans.fi << ' ' << ans.se;
    return 0;
}
/*
*/

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -