With the development of low-cost and intelligent technologies， swarm operations are becoming a hot research topic. As the size of the swarm increases， efficient target assignment algorithms become an important research direction. In order to improve the computational efficiency of target assignment， this paper takes the surplus value of target clusters as the optimization goal， uses the greedy algorithm to select local optimal solutions step by step， and ultimately obtains an approximate global optimal solution for target assignment. Simulation of typical target assignment problems verifies the effectiveness of the proposed algorithm.