제출 #494934

#제출 시각아이디문제언어결과실행 시간메모리
494934Christopher_Trading (IZhO13_trading)C++17
0 / 100
0 ms208 KiB
#include <bits/stdc++.h>

using namespace std;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, q;
  cin >> n >> q;
  vector<pair<int,int>> g(n);
  vector<int> dist(n);
  for (int i = 0; i < q; ++i) {
    int l, r, x;
    cin >> l >> r >> x;
    --l, --r;
    g[l] = max(g[l], {x, r - l});
  }
  priority_queue<pair<int,int>> pq;

}
#Verdict Execution timeMemoryGrader output
Fetching results...