Submission #2865789
Source Code Expand
import java.util.Arrays; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); long[] a=new long[n]; long max = Long.MIN_VALUE; for(int i=0;i<n;i++){ a[i]=sc.nextLong(); max = Math.max(max,a[i]); } long absDif = Long.MAX_VALUE; int pos = n-1; if(max%2==0){ for(int j=0;j<n;j++){ if(a[j]==max) continue; long cur = Math.abs(a[j]-max/2); if(cur<=absDif){ pos = j; absDif = cur; } } } else{ for(int j=0;j<n;j++){ long cur = Math.min(Math.abs(a[j]-(max+1)/2),Math.abs(a[j]-(max-1)/2)); if(cur<=absDif){ pos = j; absDif = cur; } } } String ans = max+" "+a[pos]; System.out.println(ans); } }
Submission Info
Submission Time | |
---|---|
Task | D - Binomial Coefficients |
User | AlbertZ |
Language | Java8 (OpenJDK 1.8.0) |
Score | 400 |
Code Size | 1101 Byte |
Status | AC |
Exec Time | 475 ms |
Memory | 58084 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample1.txt, sample2.txt |
All | even0.txt, even1.txt, float.txt, odd0.txt, odd1.txt, rnd_0.txt, rnd_1.txt, rnd_2.txt, rnd_3.txt, rnd_4.txt, rnd_5.txt, rnd_6.txt, rnd_7.txt, rnd_8.txt, rnd_9.txt, sample1.txt, sample2.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
even0.txt | AC | 422 ms | 49824 KB |
even1.txt | AC | 461 ms | 46772 KB |
float.txt | AC | 445 ms | 58084 KB |
odd0.txt | AC | 405 ms | 48528 KB |
odd1.txt | AC | 466 ms | 46232 KB |
rnd_0.txt | AC | 441 ms | 46460 KB |
rnd_1.txt | AC | 438 ms | 47300 KB |
rnd_2.txt | AC | 451 ms | 47284 KB |
rnd_3.txt | AC | 440 ms | 41704 KB |
rnd_4.txt | AC | 423 ms | 44320 KB |
rnd_5.txt | AC | 475 ms | 47412 KB |
rnd_6.txt | AC | 428 ms | 46668 KB |
rnd_7.txt | AC | 432 ms | 44376 KB |
rnd_8.txt | AC | 447 ms | 47864 KB |
rnd_9.txt | AC | 439 ms | 48204 KB |
sample1.txt | AC | 94 ms | 19284 KB |
sample2.txt | AC | 93 ms | 18644 KB |