Java Object Movement

Loading a large number of objects into a map takes a lot of memory resources, and updating their location is even harder.

I loaded objects as a Java Swing Line,

and set the length to zero, setting each object as a point.

Then, using mouse inputs, the code moves the objects to however close they can get to the point.

The object movement needs work, but the code works.

I set up a JFrame and drew 36000 points on it, then saved their location into an array.

I updated their location based on a mouseClick event, and then moved the points, and called a repaint();

import java.awt.*;
import java.awt.event.*;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;

import javax.swing.*;
public class Main extends JPanel{
	public static class Pair implements Comparable
	{
		public int x,y,d;
		public Pair(int x,int y,int d)
		{
			this.x=x;
			this.y=y;
			this.d=d;
		}
		@Override
		public int compareTo(Pair o)
		{
		    return (int)(this.d - o.d);
		}
	}
	static int[][] map=new int[600][1000];
	static int locX=0,locY=0;
	static Pair[] val=new Pair[36000];
	static Pair[] des=new Pair[360000];
	public static void main(String args[])
	{
		Main drawMap=new Main();
		JFrame frame = new JFrame("moveObjectTest");
        frame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);
        frame.getContentPane().add(drawMap);
        frame.setSize(1031,651);
        frame.setVisible(true);
        for(int i=0;i<36000;i++){val[i]=new Pair(i/600,i%600,0);}
        frame.addMouseListener(new MouseAdapter()
        {
        	public void mouseClicked(MouseEvent e)
        	{
        		locX=e.getX()-16;
        		locY=e.getY()-32;
                for(int i=0;i<36000;i++)val[i]=new Pair(val[i].x,val[i].y,(int)(Math.pow(val[i].x-locX,2)+Math.pow(val[i].y-locY,2)));
        		Arrays.sort(val);
        		int k=0;
        		for(int x=0;x<1001;x++)
        		{
        		    for(int y=0;y<601;y++)
        		    {
        		        double dx=x-locX,dy=y-locY,ds=dx*dx+dy*dy;
        		        if(ds<=90000)
        		        {
        		        	des[k]=new Pair(x,y,(int)(Math.pow(x-locX,2)+Math.pow(y-locY,2)));
        		        	k++;
        		        }
        		    }
        		}
        		Arrays.sort(des,0,k);
        		ActionListener stTask=new ActionListener()
        		{
        		      public void actionPerformed(ActionEvent f)
        		      {
        		    	  boolean l=true;
        		          for(int i=0;i<36000;i++)
        		          {
        		        	  if(l&&(val[i].x!=des[i].x||val[i].y!=des[i].y))l=false;
        		        	  if(val[i].x>des[i].x)val[i].x--;
        		        	  else if(val[i].xdes[i].y)val[i].y--;
        		        	  else if(val[i].y