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 fireworks[m][2], len = (long long)1E18;
for (int i = 0; i < m; ++i) {
cin >> fireworks[i][0] >> fireworks[i][1];
}
for (int i = 0; i < m; ++i) {
long long pivot = fireworks[i][1];
long long tmp = 0;
for (int j = 0; j < m; ++j) {
tmp += abs(fireworks[j][1] - pivot);
}
len = min(len, tmp);
}
cout << len << '\n';
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |