Lưu ý: Các code mẫu dưới đây chỉ mang tính tham khảo và có thể không AC được bài tập này

Code mẫu của flashmt

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <utility>
using namespace std;

int main()
{
    int n, t, p;
    priority_queue < pair<long long,int> > q;
    q.push(make_pair(0, 0));
    cin >> n;
    for (int i = 1; i <= n + 1; i++)
    {
        pair <long long,int> u;
        while (1)
        {
            u = q.top();
            if (u.second + 1 >= i) break;
            q.pop();
        }

        long long f = -u.first;
        if (i > n)
        {
            cout << f << endl;
            break;
        }

        scanf("%d%d", &t, &p);
        q.push(make_pair(-f - p, t));
    }
}

Code mẫu của happyboy99x

#include <iostream>
#include <cstring>
using namespace std;

const int N = (int) 5e5;
int latest[N];
int price[N];
int n;
long long bit[N + 1];
long long f[N];

void update(int at, long long by) {
    while (at <= n) {
        bit[at] = min(bit[at], by);
        at |= at + 1;
    }
}

long long get(int at) {
    long long result = (long long) 1e18;
    while (at >= 0) {
        result = min(result, bit[at]);
        at -= ~at & (at + 1);
    }
    return result;
}

int main() {
    ios::sync_with_stdio(false);
    cin >> n;
    for (int i = 0; i < n; ++i) {
        cin >> latest[i] >> price[i];
    }
    memset(bit, 0x3f, sizeof bit);
    update(n, 0);
    for (int i = n - 1; i >= 0; --i) {
        update(i, f[i] = price[i] + get(latest[i]));
    }
    cout << f[0] << '\n';
    return 0;
}

Code mẫu của ladpro98

program hirehp;
uses    math;
type    e=record
        t,p:longint;
        end;
const   maxn=500005;
        oo=high(int64);
        fi='';
var     a:array[1..maxn] of e;
        f:array[1..maxn] of int64;
        it:array[1..4*maxn] of int64;
        n:longint;
        res:int64;

procedure input;
var     inp:text;
        i:longint;
begin
        assign(inp,fi);
        reset(inp);
        readln(inp,n);
        for i:=1 to n do
        readln(inp,a[i].t,a[i].p);
        close(inp);
end;

procedure update(k,l,r,i:longint; v:int64);
var     m:longint;
begin
        if (r<i) or (i<l) then exit;
        if l=r then
        begin
                it[k]:=min(it[k],v);
                exit;
        end;
        m:=(l+r) shr 1;
        update(2*k,l,m,i,v);
        update(2*k+1,m+1,r,i,v);
        it[k]:=min(it[2*k],it[2*k+1]);
end;

procedure get(k,l,r,i,j:longint);
var     m:longint;
begin
        if (r<i) or (j<l) then exit;
        if (i<=l) and (r<=j) then
        begin
                res:=min(res,it[k]);
                exit;
        end;
        m:=(l+r) shr 1;
        get(2*k,l,m,i,j);
        get(2*k+1,m+1,r,i,j);
end;

procedure dp;
var     i:longint;
begin
        for i:=1 to 4*n do
        it[i]:=oo;
        f[1]:=a[1].p;
        update(1,1,n,a[1].t,f[1]);
        for i:=2 to n do
        begin
                res:=oo;
                get(1,1,n,i-1,n);
                f[i]:=res+a[i].p;
                update(1,1,n,a[i].t,f[i]);
        end;
end;

procedure output;
var     i:longint;
        res:int64;
begin
        res:=oo;
        for i:=1 to n do
        if a[i].t>=n then
        res:=min(res,f[i]);
        write(res);
end;

begin
        input;
        dp;
        output;
end.

Code mẫu của RR

#include <sstream>
#include <iomanip>
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <string>
#include <deque>
#include <complex>

#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for(int i=(a),_b=(b); i>=_b; i--)
#define REP(i,a) for(int i=0,_a=(a); i<_a; i++)
#define FORN(i,a,b) for(int i=(a),_b=(b);i<_b;i++)
#define DOWN(i,a,b) for(int i=a,_b=(b);i>=_b;i--)
#define SET(a,v) memset(a,v,sizeof(a))
#define sqr(x) ((x)*(x))
#define ll long long
#define F first
#define S second
#define PB push_back
#define MP make_pair

#define DEBUG(x) cout << #x << " = "; cout << x << endl;
#define PR(a,n) cout << #a << " = "; FOR(_,1,n) cout << a[_] << ' '; cout << endl;
#define PR0(a,n) cout << #a << " = "; REP(_,n) cout << a[_] << ' '; cout << endl;
using namespace std;

//Buffer reading
int INP,AM,REACHEOF;
#define BUFSIZE (1<<12)
char BUF[BUFSIZE+1], *inp=BUF;
#define GETCHAR(INP) { \
    if(!*inp) { \
        if (REACHEOF) return 0;\
        memset(BUF,0,sizeof BUF);\
        int inpzzz = fread(BUF,1,BUFSIZE,stdin);\
        if (inpzzz != BUFSIZE) REACHEOF = true;\
        inp=BUF; \
    } \
    INP=*inp++; \
}
#define DIG(a) (((a)>='0')&&((a)<='9'))
#define GN(j) { \
    AM=0;\
    GETCHAR(INP); while(!DIG(INP) && INP!='-') GETCHAR(INP);\
    if (INP=='-') {AM=1;GETCHAR(INP);} \
    j=INP-'0'; GETCHAR(INP); \
    while(DIG(INP)){j=10*j+(INP-'0');GETCHAR(INP);} \
    if (AM) j=-j;\
}
//End of buffer reading

const long double PI = acos((long double) -1.0);
const int MN = 500111;

int n, t[MN], p[MN];
ll f[MN], it[MN * 8];

#define CT(x) ((x) << 1)
#define CP(x) (CT(x) + 1)

const ll oo = 1000111000111000111LL;

void init(int i, int l, int r) {
    if (l == r) {
        it[i] = oo;
        return ;
    }
    int mid = (l + r) >> 1;
    init(CT(i), l, mid);
    init(CP(i), mid+1, r);
}

void update(int i, int l, int r, int u, long long k) {
    if (u < l || r < u) return ;
    if (l == r) {
        it[i] = k;
        return ;
    }
    int mid = (l + r) >> 1;
    update(CT(i), l, mid, u, k);
    update(CP(i), mid+1, r, u, k);

    it[i] = min(it[CT(i)], it[CP(i)]);
}

ll getMin(int i, int l, int r, int u, int v) {
    if (v < l || r < u) return oo;
    if (u <= l && r <= v) return it[i];
    int mid = (l + r) >> 1;
    return min(getMin(CT(i), l, mid, u, v), getMin(CP(i), mid+1, r, u, v));
}

int main() {
    scanf("%d", &n);
    FOR(i,1,n) scanf("%d%d", &t[i], &p[i]);

    init(1,1,n);

    FORD(i,n,1) {
        if (t[i] == n) f[i] = p[i];
        else {
            f[i] = getMin(1, 1, n, i+1, t[i]+1) + p[i];
        }
        update(1, 1, n, i, f[i]);
    }
    cout << f[1] << endl;
    return 0;
}

Code mẫu của hieult

#include <set>
#include <map>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <sstream>
#include <iomanip>
#include <iostream>
#include <algorithm>

#include <ctime>
#include <deque>
#include <bitset>
#include <cctype>
#include <utility>
#include <cassert>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned int ui;
typedef unsigned long long ull;

#define Rep(i,n) for(int i = 0; i < (n); ++i)
#define Repd(i,n) for(int i = (n)-1; i >= 0; --i)
#define For(i,a,b) for(int i = (a); i <= (b); ++i)
#define Ford(i,a,b) for(int i = (a); i >= (b); --i)
//#define Fit(i,v) for(__typeof((v).begin()) i = (v).begin(); i != (v).end(); ++i)
//#define Fitd(i,v) for(__typeof((v).rbegin()) i = (v).rbegin(); i != (v).rend(); ++i)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define sz(a) ((int)(a).size())
#define all(a) (a).begin(), (a).end()
#define ms(a,x) memset(a, x, sizeof(a))

template<class F, class T> T convert(F a, int p = -1) { stringstream ss; if (p >= 0) ss << fixed << setprecision(p); ss << a; T r; ss >> r; return r; }
template<class T> T gcd(T a, T b) { T r; while (b != 0) { r = a % b; a = b; b = r; } return a; }
template<class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template<class T> T sqr(T x) { return x * x; }
template<class T> T cube(T x) { return x * x * x; }
template<class T> int getbit(T s, int i) { return (s >> i) & 1; }
template<class T> T onbit(T s, int i) { return s | (T(1) << i); }
template<class T> T offbit(T s, int i) { return s & (~(T(1) << i)); }
template<class T> int cntbit(T s) { return s == 0 ? 0 : cntbit(s >> 1) + (s & 1); }

const int bfsz = 1 << 16;
char bf[bfsz + 5];
int rsz = 0;
int ptr = 0;
char gc() {
    if (rsz <= 0) {
        ptr = 0;
        rsz = (int) fread(bf, 1, bfsz, stdin);
        if (rsz <= 0)
            return EOF;
    }
    --rsz;
    return bf[ptr++];
}
void ga(char &c) {
    c = EOF;
    while (!isalpha(c))
        c = gc();
}
int gs(char s[]) {
    int l = 0;
    char c = gc();
    while (isspace(c))
        c = gc();
    while (c != EOF && !isspace(c)) {
        s[l++] = c;
        c = gc();
    }
    s[l] = '\0';
    return l;
}
template<class T> bool gi(T &v) {
    v = 0;
    char c = gc();
    while (c != EOF && c != '-' && !isdigit(c))
        c = gc();
    if (c == EOF)
        return false;
    bool neg = c == '-';
    if (neg)
        c = gc();
    while (isdigit(c)) {
        v = v * 10 + c - '0';
        c = gc();
    }
    if (neg)
        v = -v;
    return true;
}

typedef pair<int, int> II;

const ld PI = acos(-1.0);
const ld eps = 1e-9;

const int dr[] = {0, +1, 0, -1};
const int dc[] = {+1, 0, -1, 0};

const int inf = (int)1e9 + 5;
const ll linf = (ll)1e16 + 5;
const ll mod = (ll)1e9 + 7;

#define maxn 1000005

ll f[maxn];
int n, u, v;

ll get(int u){
    ll res = linf;
    for(int i = u; i < maxn; i += i & -i) res = min(f[i], res);
    return res;
}

void update(int u, ll x){
    for(int i = u; i > 0; i -= i & -i) f[i] = min(f[i], x);
}

int  main()
{
//  freopen("in.txt", "r", stdin);
    ms(f, 0x3f);
    f[0] = 0;
    cin >> n;
    Rep(run, n){
        scanf("%d %d", &u, &v);
        ll x = 0;
        if(run > 0) x = get(run);
        update(u, x + v);
    }

    ll res = get(n);
    cout << res;
     // getch();
}

Code mẫu của skyvn97

#include<bits/stdc++.h>
#define MAX   500025
using namespace std;
typedef long long ll;
const ll INF=(ll)1e13;
struct car {
    int st,en;
    ll pr;
    car(){}
    car(const int &_st,const int &_en,const ll &_pr) {
        st=_st;en=_en;pr=_pr;
    }
    bool operator <(const car &x) const {
        if (en<x.en) return (true);
        if (en>x.en) return (false);
        return (st<x.st);
    }
};
car a[MAX];
ll f[MAX];
ll t[4*MAX];
int id[MAX];
int n;
void minimize(ll &x,const ll &y) {
    if (x>y) x=y;
}
ll min(const ll &x,const ll &y) {
    if (x<y) return (x); else return (y);
}
void init(void) {
    int i,e;
    ll p;
    scanf("%d",&n);
    for (i=1;i<=n;i=i+1) {
        scanf("%d",&e);
        scanf("%lld",&p);
        a[i]=car(i,e,p);
    }
    sort(&a[1],&a[n+1]);
    for (i=1;i<=4*n;i=i+1) t[i]=INF;
    for (i=1;i<=n;i=i+1) {
        f[i]=INF;
        id[a[i].st]=i;
    }   
}
void update(const int &x,const ll &val) {
    int i,l,m,r;
    i=1;l=0;r=n;
    while (true) {
        minimize(t[i],val);
        if (l==r) return;
        m=(l+r)/2;
        if (x>m) {
            i=2*i+1;
            l=m+1;      
        }
        else {
            i=2*i;
            r=m;
        }
    }
}
ll minv(int i,int l,int r,int u,int v) {
    if (l>v) return (INF);
    if (r<u) return (INF);
    if (l>r) return (INF);
    if (u<=l && r<=v) return (t[i]);
    int m=(l+r)/2;
    ll left=minv(2*i,l,m,u,v);
    ll right=minv(2*i+1,m+1,r,u,v);
    return (min(left,right));
}
int lowerval(const int &val) {
    int l,m,r;
    l=1;r=n;
    while (true) {
        if (l==r) return (r);
        if (r-l==1) {
            if (a[l].en>=val) return (l);
            else return (r);
        }
        m=(l+r)/2;
        if (a[m].en>=val) r=m;
        else l=m+1;
    }
}
void optimize(void) {
    f[0]=0;
    update(id[1],f[0]+a[id[1]].pr);
    int i,t;
    for (i=1;i<=n;i=i+1) {
        t=lowerval(i);
        f[i]=minv(1,0,n,t,n);
        update(id[i+1],f[i]+a[id[i+1]].pr);
    }
    printf("%lld",f[n]);
}
int main(void) {
    init();
    optimize();
    return 0;
}