| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1083780 | bvd | Art Exhibition (JOI18_art) | C++14 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
import java.util.Arrays;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.io.BufferedOutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.OutputStream;
public class art {
private static class Kattio extends PrintWriter {
public Kattio(InputStream i) {
super(new BufferedOutputStream(System.out));
r = new BufferedReader(new InputStreamReader(i));
}
public Kattio(InputStream i, OutputStream o) {
super(new BufferedOutputStream(o));
r = new BufferedReader(new InputStreamReader(i));
}
public boolean hasMoreTokens() {
return peekToken() != null;
}
public int getInt() {
return Integer.parseInt(nextToken());
}
public double getDouble() {
return Double.parseDouble(nextToken());
}
public long getLong() {
return Long.parseLong(nextToken());
}
public String getWord() {
return nextToken();
}
private BufferedReader r;
private String line;
private StringTokenizer st;
private String token;
private String peekToken() {
if (token == null)
try {
while (st == null || !st.hasMoreTokens()) {
line = r.readLine();
if (line == null)
return null;
st = new StringTokenizer(line);
}
token = st.nextToken();
} catch (IOException e) {
}
return token;
}
private String nextToken() {
String ans = peekToken();
token = null;
return ans;
}
}
private static final class Artwork {
public final long a;
public final int b;
public Artwork(long a, int b) {
this.a = a;
this.b = b;
}
}
private static int clamp(long x) {
if (x < 0) return -1;
if (x > 0) return 1;
return 0;
}
public static void main(String[] args) {
try (Kattio io = new Kattio(System.in, System.out)) {
int n = io.getInt();
Artwork[] artworks = new Artwork[n];
for (int i=0; i<n; ++i) {
artworks[i] = new Artwork(io.getLong(), io.getInt());
}
Arrays.sort(artworks, (t, o) -> clamp(t.a - o.a));
long[] f = new long[n+1];
f[0] = 0;
long minSoFar = (long) 4e18;
long result = 0;
long prev = 0;
for (int i=0; i<n; ++i) {
long cur = prev + artworks[i].b;
result = Math.max(result, artworks[i].b);
long tmp = cur - artworks[i].a;
result = Math.max(result, tmp - minSoFar);
minSoFar = Math.min(minSoFar, prev - artworks[i].a);
prev = cur;
}
io.println(result);
}
}
}