滴滴2017校招算法工程师笔试题--吃饭问题

最新推荐文章于 2025-03-09 18:53:29 发布

lyg1112

最新推荐文章于 2025-03-09 18:53:29 发布

阅读量3k

点赞数

分类专栏： Java

本文链接：https://blog.youkuaiyun.com/lyg1112/article/details/52459554

版权

import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		while (scan.hasNext()) {
			int n = scan.nextInt();
			int m = scan.nextInt();

			ArrayList<Integer> desk = new ArrayList<Integer>();
			for (int i = 0; i < n; i++) {
				desk.add(scan.nextInt());
			}
			Collections.sort(desk);

			ArrayList<Group> customer = new ArrayList<Group>();
			for (int i = 0; i < m; i++) {
				Group tem = new Group();
				tem.setN(scan.nextInt());
				tem.setC(scan.nextInt());
				customer.add(tem);
			}
			Collections.sort(customer, new Comp().comparator);
			
			int res = 0;
			for(int i = 0; i < m; i++){
				int loc = n;
				if( desk.isEmpty()){
					break;