package BiShi.AQY;
import java.io.File;
import java.io.FileNotFoundException;
import java.util.ArrayList;
import java.util.PriorityQueue;
import java.util.Scanner;
public class AQY_4 {
//输入三个数组，一个数å—m
//返回m长的三元组
public ArrayList> getTupple(int[] nums1,int[] nums2,int[] nums3,int m){
ArrayList> res=new ArrayList<>();
PriorityQueueheap1=new PriorityQueue<>(m,(a,b)->(b-a));
PriorityQueueheap2=new PriorityQueue<>(m,(a,b)->(b-a));
PriorityQueueheap3=new PriorityQueue<>(m,(a,b)->(b-a));
int n=nums1.length;
for (int i = 0; i tmp=new ArrayList<>();
int num1=heap1.poll();
tmp.add(num1);
int num2=heap2.poll();
tmp.add(num2);
int num3=heap3.poll();
tmp.add(num3);
res.add(tmp);
}
return res;
}
}