#include <bits/stdc++.h>
int main()
{
int numJ, numE;
std::cin >> numJ;
std::cin >> numE;
if (numJ != 1)
return 1;
int minDelay = INT32_MAX;
int maxDelay = 0;
std::vector<int> delay(numE);
for (int i = 0; i < numE; i++)
{
int n, l;
std::cin >> n;
std::cin >> l;
minDelay = std::min(l, minDelay);
maxDelay = std::max(l, maxDelay);
delay[i] = l;
}
int minCost = INT32_MAX;
for (int d = minDelay; d <= maxDelay; d++)
{
int cost = 0;
for (int j = 0; j < numE; j++)
{
cost += std::abs(delay[j] - d);
}
minCost = std::min(minCost, cost);
}
std::cout << minCost << std::endl;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
376 KB |
Output is correct |
2 |
Execution timed out |
2061 ms |
476 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
3 ms |
476 KB |
Execution failed because the return code was nonzero |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
376 KB |
Output is correct |
2 |
Execution timed out |
2061 ms |
476 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
376 KB |
Output is correct |
2 |
Execution timed out |
2061 ms |
476 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |