#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
#define sp " "
#define endl "\n"
#define pii pair<int, int>
#define st first
#define nd second
#define fileio() freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout)
#define fastio() cin.tie(0), ios_base::sync_with_stdio(0)
#define pb push_back
#define ll long long
#define LL node * 2
#define RR node * 2 + 1
#define MAXN 300005
const int modulo = 1e9 + 7;
const ll INF = 2e18 + 7;
long long max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
int n = N, m = M;
vector<array<int, 3>> v;
for (int i = 0; i < m; i++) v.pb({X[i], Y[i], W[i]});
sort(v.begin(), v.end());
vector<int> x(m, 0), y(m, 0), w(m, 0);
for (int i = 0; i < m; i++){
x[i] = v[i][0], y[i] = v[i][1], w[i] = v[i][2];
}
vector<vector<ll>> dp(2, vector<ll> (m + 5, 0));
vector<vector<ll>> start(2, vector<ll> (n + 5, 0));
vector<vector<pii>> fish(n + 5);
vector<ll> pre(m + 5, 0);
pre[0] = w[0];
for (int i = 1; i < m; i++) pre[i] = pre[i - 1] + w[i];
return pre[m - 1];
}
/*
int main() {
fileio();
int N, M;
assert(2 == scanf("%d %d", &N, &M));
std::vector<int> X(M), Y(M), W(M);
for (int i = 0; i < M; ++i) {
assert(3 == scanf("%d %d %d", &X[i], &Y[i], &W[i]));
}
long long result = max_weights(N, M, X, Y, W);
printf("%lld\n", result);
return 0;
}*/
