# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
631868 | ntarsis | Catfish Farm (IOI22_fish) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,m; cin >> n >> m;
long long nums[m][2];
long long weights[m];
for (int i = 0; i < m; i++){
cin >> nums[i][0] >> nums[i][1];
cin >> weights[i];
}
long long ans = 0;
for (int i : weights) ans += i;
cout << ans << "\n";
}