#include #include #include using namespace std; int main(){ int N, M; cin >> N >> M; vector>> E(N); for (int i = 0; i < M; i++){ int a, b, c; cin >> a >> b >> c; a--; b--; E[a].push_back(make_pair(c, b)); E[b].push_back(make_pair(c, a)); } vector dp(1 << N, 0); for (int i = 1; i < (1 << N); i++){ for (int j = 0; j < N; j++){ if (i >> j & 1){ for (auto P : E[j]){ int k = P.second; if (!(i >> k & 1)){ dp[i | (1 << k)] = max(dp[i | (1 << k)], dp[i] + P.first); } } } } } int ans = 0; for (int i = 0; i < (1 << N); i++){ ans = max(ans, dp[i]); } }