【百度笔试】9.10java
一、发工资
import java.util.*;
class Node{
int x;
int y;
public Node(int x,int y){
this.x = x;
this.y = y;
}
}
public class B1 {
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int m = sc.nextInt();
List<Node> list = new ArrayList<>();
for(int i = 0;i<n;i++){
Node node = new Node(sc.nextInt(),sc.nextInt());
list.add(node);
}
list.sort(new Comparator<Node>() {
public int compare(Node o1, Node o2) {
return o1.x -o2.x;
}
});
int k ,ans = 0;
for(k = n-1;k>=0;k--){
if(list.get(k).x>=m){
ans += list.get(k).y;
}else
break;
}
boolean flag = true;
while(flag){
flag = false;
int t = m;
//优先大面额
for(int i = k;i>=0;i--){
while(t >list.get(i).x && list.get(i).y >0){
t -= list.get(i).x;
list.get(i).y--;
}
}
//再用小面额填补
for(int i = 0;i<=k;i++){
while(t>0 && list.get(i).y>0){
t -= list.get(i).x;
list.get(i).y --;
}
}
if(t <= 0){
flag = true;
ans ++;
}
}
System.out.println(ans);
}
}
二、士兵扎营个数
import java.util.Scanner;
public class B2 {
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int k = sc.nextInt();
System.out.println(solve(n,k));
}
private static int solve(int n,int k){
if((n-k)%2 != 0 || n<=k){
return 1;
}else{
return solve((n-k)/2,k) + solve((n+k)/2,k);
}
}
}
三、删除叶子节点。
有个错的思路，搞了一会没时间了。有大佬帮忙提供一个思路。
AC了前两个
#笔试题目##笔经##百度#
