| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 3150 | movie_jo | 점 모으기 (KOI13_collect) | C++98 | 40 ms | 1868 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 <stdio.h>
#include "algorithm"
using namespace std;
int x[100000], y[100000];
int main(void)
{
int N, M, i, cx, cy, s = 0;
scanf("%d %d", &N, &M);
for(i = 0; i < M; i++)
scanf("%d %d",&x[i], &y[i]);
sort(x, x+M);
sort(y, y+M);
cx = x[M / 2];
cy = y[M / 2];
for(i = 0; i < M; i++)
{
s += cx > x[i] ? cx - x[i] : x[i] - cx;
s += cy > y[i] ? cy - y[i] : y[i] - cy;
}
printf("%d\n", s);
}| # | 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... | ||||
| # | 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... | ||||
