| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1156620 | guagua0407 | Ski 2 (JOI24_ski2) | C++20 | 0 ms | 328 KiB | 
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define f first
#define s second
#define all(x) x.begin(),x.end()
#define _ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int dx[4]={0,0,1,-1};
int dy[4]={1,-1,0,0};
void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}
const ll inf=(ll)1e18;
int main() {_
    int n,k;
    cin>>n>>k;
    vector<int> c(n),h(n);
    for(int i=0;i<n;i++){
        cin>>h[i]>>c[i];
    }
    vector<pair<int,int>> vec;
    for(int i=0;i<n;i++){
        vec.push_back({h[i],c[i]});
    }
    sort(all(vec));
    int l=0;
    ll mn=inf;
    ll ans=0;
    for(int r=1;r<n;r++){
        if(vec[r].f==vec[0].f){
            vec[r].f++;
            ans+=k;
        }
        if(l<r and vec[l].f<vec[r].f){
            mn=min(mn,(ll)vec[l].s);
            l++;
        }
        else{
            ans+=mn;
        }
    }
    cout<<ans<<'\n';
    return 0;
}
//maybe its multiset not set
//yeeorz
//diaoborz
// dp(i-1,j,k)->dp(i,j+a,max(a,k))
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... | ||||
