Submission #61214

#TimeUsernameProblemLanguageResultExecution timeMemory
61214Eae02Fireworks (APIO16_fireworks)C++14
0 / 100
3 ms556 KiB
#include <bits/stdc++.h> int main() { int numJ, numE; std::cin >> numJ; std::cin >> numE; if (numJ != 1) return 1; std::vector<int> delay(numE); for (int i = 0; i < numE; i++) { int n, l; std::cin >> n; std::cin >> l; if (i != 0) { delay[i - 1] = l; } } int minCost = INT32_MAX; for (int i = 0; i < numE; i++) { int cost = 0; for (int j = 0; j < numE; j++) { cost += std::abs(delay[j] - delay[i]); } minCost = std::min(minCost, cost); } std::cout << minCost << std::endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...