java 【2022.11 Q4 新题 1- 10】

1【最大化控制资源成本】200

import java.util.*;

import java.util.stream.Collectors;

class Main {

public static void main(String[] args) {

// 输入处理

Scanner in = new Scanner(System.in);

int n = in.nextInt();

Integer[][] ranges = new Integer[n][3];

for (int i = 0; i < n; i++) {

ranges[i][0] = in.nextInt();

ranges[i][1] = in.nextInt();

ranges[i][2] = in.nextInt();

}

// 区间排序

Arrays.sort(ranges, (a, b) -> a[0] - b[0]);

HashSet<Integer> points = new HashSet<>();

for (Integer[] se : ranges) {

points.add(se[0]);

points.add(se[1]);

}

// 点排序

Integer[] points_arr = points.toArray(new Integer[0]);

Arrays.sort(points_arr, (a, b) -> a - b);

int result = 0;

HashSet<Integer> ignore = new HashSet<>();

//遍历每一个点

for (Integer point : points_arr) {

int current_count = 0;

// 判断这个点是否在此区间内

for (int i = 0; i < ranges.length; i++) {

if (ignore.contains(i)){

continue;

}

if (point < ranges[i][0]){

break;

}

else if (point < ranges[i][1]){

current_count += ranges[i][2];

}

else{

ignore.add(i);

}

}

result = Math.max(result, current_count);

}

System.out.println(result);

}

}

新解法

import java.util.Scanner;

import java.util.*;

import java.util.stream.Collectors;

import java.math.BigInteger;

import java.util.stream.Stream;

class Main {

public static void main(String[] args) {

// 输入处理

Scanner in = new Scanner(System.in);

int n = in.nextInt();

int[][] ranges = new int[n][3];

for (int i = 0; i < n; i++) {

ranges[i][0] = in.nextInt();

ranges[i][1] = in.nextInt();

ranges[i][2] = in.nextInt();

}

System.out.println(minMeetingRooms(ranges));

}

public static int minMeetingRooms(int[][] ranges) {

Arrays.sort(ranges, (a, b) -> a[0] - b[0]);

PriorityQueue<Integer[]> pq = new PriorityQueue<>((a, b) -> a[0] - b[0]);

int res = 0;

int temp_res = 0;

for (int i = 0; i < ranges.length; i ++ ) {

while (pq.size() > 0) {

Integer[] top = pq.peek();

if (top[0] < ranges[i][0]) {

Integer[] poll = pq.poll();

temp_res -= poll[1];

} else {

break;

}

}

pq.offer(new Integer[] {ranges[i][1], ranges[i][2]});

temp_res += ranges[i][2];

if (temp_res > res) {

res = temp_res;

}

}

return res;

}

}

2【租车骑绿岛】100

import java.util.Scanner;

import java.util.*;

import java.util.stream.Collectors;

public class Main {

public static int max_machine=0;

public static void main(String[] args) {

//处理输入

Scanner in=new Scanner(System.in);

int m = in.nextInt();

int n = in.nextInt();

ArrayList<Integer> weights = new ArrayList<Integer>();

for (int i=0;i<n;i++) {

int a = in.nextInt();

weights.add(a);

//System.out.println(s);

}

Collections.sort(weights);

//第二步，左右指针向中间移动

int left=0;

int right = weights.size()-1;

//结果

int min_bikes = 0;

//当前重量

int temp_weight = weights.get(right) + weights.get(left);

// 题目中有两个隐含的条件

// 1: 一辆车最多骑两个人

// 2