weighted LIS

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

int h[2010], a[2010], dp[2010];

signed main(){
    int n;
    cin >> n;
    for(int i=0;i<n;i++) cin >> h[i] >> a[i];
    for(int i=0;i<n;i++){
        dp[i] = a[i];
        for(int j=0;j<i;j++){
            if(h[j] < h[i]) dp[i] = max(dp[i], dp[j] + a[i]);
        }
    }
    cout << *max_element(dp, dp+n) << endl;
}