Submission #2068478

---

Source Code Expand

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#include <iomanip>
#include <cassert>
#include <bitset>
using namespace std;

typedef pair<int, int> P;
#define rep(i, n) for (int i=0; i<(n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
#define index(xs, x) (int)(lower_bound(all(xs), x) - xs.begin())
#define _1 first
#define _2 second
#define pb push_back
#define INF 1145141919
#define MOD 1000000007

int N, L;
vector<int> G[100000];
int dp[100001];
signed main() {
  ios::sync_with_stdio(false); cin.tie(0);
  cin >> N >> L;
  rep(i, N) {
    int t, p;
    cin >> t >> p;
    t--;
    G[t].pb(p);
  }
  rep(t, 2000) {
    rep(i, L+1) for (int p : G[t]) dp[i] += abs(i-p);
    rep(i, L) dp[i+1] = min(dp[i+1], dp[i]);
  }
  cout << dp[L] << "\n";
  return 0;
}

Submission Info

Judge Result