Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- using System;
- namespace Algorytmy_Problem_A
- {
- class Program
- {
- static void Main(string[] args)
- {
- int totalTests = Convert.ToInt32(Console.ReadLine());
- for (int currentTest = 0; currentTest < totalTests; currentTest++)
- {
- int nFriends = Convert.ToInt32(Console.ReadLine());
- int minDistance = int.MaxValue;
- string inputString;
- string[] coordinates;
- int sumDistance;
- int[,] firendsArray = new int[2, nFriends];
- for (int i = 0; i < nFriends; i++)
- {
- inputString = Console.ReadLine();
- coordinates = inputString.Split(' ');
- firendsArray[0, i] = Convert.ToInt32(coordinates[0]);
- firendsArray[1, i] = Convert.ToInt32(coordinates[1]);
- }
- for (int i = 0; i < nFriends; i++)
- {
- sumDistance = 0;
- for (int j = 0; j < nFriends; j++)
- if (j != i)
- sumDistance += Math.Abs(firendsArray[0, i] - firendsArray[0, j]) +
- Math.Abs(firendsArray[1, i] - firendsArray[1, j]);
- if (sumDistance <= minDistance)
- minDistance = sumDistance;
- }
- Console.WriteLine(minDistance);
- }
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement