贪心部分的最后一题(推公式)
题目
来自AcWing 洛希krist 同学的整理:
思路: 与国王游戏的贪心策略相似, 我们先分析每头牛的危险值 = 他前面牛的w(重量值)和 - 自身的s(强壮值),要使每头牛的危险值最小,这显然是与w 和 s同时相关,所以先 yy 出一种做法按 每头牛的w + s进行升序排序
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Collections;
class Main {
static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
static PrintWriter pw = new PrintWriter(System.out);
public static void main(String[] args) throws IOException {
int n = Integer.parseInt(br.readLine());
String s[];
ArrayList<Pair> al = new ArrayList<>();
for (int i = 0; i < n; i++) {
s = br.readLine().split(" ");
al.add(new Pair(Integer.parseInt(s[0]) + Integer.parseInt(s[1]), Integer.parseInt(s[0])));
}
Collections.sort(al);
int res = (int) -2e9;
int sum = 0;
for (int i = 0; i < n; i++) {
int w = al.get(i).getSecond();
int ss = al.get(i).getFirst() - w;
res = Math.max(res, sum - ss);
sum += w;
}
pw.println(res);
pw.flush();
pw.close();
br.close();
}
}
class Pair implements Comparable<Pair> {
int first;
int second;
public int getFirst() {
return first;
}
public void setFirst(int first) {
this.first = first;
}
public int getSecond() {
return second;
}
public void setSecond(int second) {
this.second = second;
}
public Pair(int first, int second) {
this.first = first;
this.second = second;
}
@Override
public int compareTo(Pair o) {
return this.first - o.getFirst();
}
}
明天考试就全部结束了,然后就能去久违的基律纳看极光啦,看完极光回来就终于能回国了。。