Submission #499879

#	Time	Username	Problem	Language	Result	Execution time	Memory
499879		Jaguar	Cheap flights (LMIO18_pigus_skrydziai)	C++14	0 / 100	3014 ms	4196 KiB

pigus_skrydziai

#include <bits/stdc++.h>
using namespace std;
struct keliai{
    int start;
    int end;
    int profit;
};
int main()
{
    int n, m, maks=0;
    cin >> n >> m;
    keliai kelias[m];
    for (int i=0;i<m;i++){
        cin >> kelias[i].start >> kelias[i].end >> kelias[i].profit;
    }
    for (int j=0;j<n;j++){
        int tmaks=0;
        for (int i=0;i<m;i++){
            if(j==kelias[i].start||j==kelias[i].end)tmaks+=kelias[i].profit;
        }
        maks=max(tmaks, maks);
    }
    cout << maks;
}

• Subtask 1: 0 / 12
• Subtask 2: 0 / 25
• Subtask 3: 0 / 16
• Subtask 4: 0 / 47