제출 #590770

#제출 시각아이디문제언어결과실행 시간메모리
590770KiprasCheap flights (LMIO18_pigus_skrydziai)C++17
0 / 100
66 ms7120 KiB
#include <bits/stdc++.h>

typedef long long ll;

using namespace std;

const ll maxN = 3e5+10;

ll n, m;
ll v[maxN]={0};

int main()
{

    ios_base::sync_with_stdio(0);cin.tie(nullptr);

    cin>>n>>m;
    for(int i = 0; i < m; i++){
        ll aa, bb, cc;
        cin>>aa>>bb>>cc;
        v[aa]+=cc;
        v[bb]+=cc;
    }

    ll res=0;

    for(int i = 1; i <= n; i++){
        res=max(res, v[i]);
    }

    cout<<res;

    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...