Submission #4066873
Source Code Expand
import java.io.OutputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; import java.io.IOException; import java.io.InputStream; /** * Built using CHelper plug-in * Actual solution is at the top */ public class Main { public static void main(String[] args) { InputStream inputStream = System.in; OutputStream outputStream = System.out; FastScanner in = new FastScanner(inputStream); PrintWriter out = new PrintWriter(outputStream); TaskB solver = new TaskB(); solver.solve(1, in, out); out.close(); } static class TaskB { public void solve(int testNumber, FastScanner in, PrintWriter out) { int n = in.nextInt(); int[] a = in.nextIntArray(n); Arrays.sort(a); out.println(a[n - 1] - a[0]); } } static class FastScanner { private InputStream in; private byte[] buffer = new byte[1024]; private int bufPointer; private int bufLength; public FastScanner(InputStream in) { this.in = in; } private int readByte() { if (bufPointer >= bufLength) { if (bufLength == -1) throw new InputMismatchException(); bufPointer = 0; try { bufLength = in.read(buffer); } catch (IOException e) { throw new InputMismatchException(); } if (bufLength <= 0) return -1; } return buffer[bufPointer++]; } private static boolean isSpaceChar(int c) { return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1; } public long nextLong() { long n = 0; int b = readByte(); while (isSpaceChar(b)) b = readByte(); boolean minus = (b == '-'); if (minus) b = readByte(); while (b >= '0' && b <= '9') { n *= 10; n += b - '0'; b = readByte(); } if (!isSpaceChar(b)) throw new NumberFormatException(); return minus ? -n : n; } public int nextInt() { long n = nextLong(); if (n < Integer.MIN_VALUE || n > Integer.MAX_VALUE) throw new NumberFormatException(); return (int) n; } public int[] nextIntArray(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = nextInt(); return a; } } }
Submission Info
Submission Time | |
---|---|
Task | B - Traveling AtCoDeer Problem |
User | kawazu |
Language | Java8 (OpenJDK 1.8.0) |
Score | 200 |
Code Size | 2915 Byte |
Status | AC |
Exec Time | 77 ms |
Memory | 20820 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt |
All | in1.txt, in2.txt, in3.txt, in4.txt, s1.txt, s2.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
in1.txt | AC | 77 ms | 20820 KB |
in2.txt | AC | 73 ms | 17748 KB |
in3.txt | AC | 73 ms | 18004 KB |
in4.txt | AC | 75 ms | 18900 KB |
s1.txt | AC | 71 ms | 17620 KB |
s2.txt | AC | 73 ms | 19668 KB |