# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1133513 | njoop | Job Scheduling (CEOI12_jobs) | Java | 433 ms | 131072 KiB |
import java.util.Scanner;
import java.util.Arrays;
public class jobs {
static int a=0;
static int b=0;
static int c=0;
static int []m;
public static void main(String args[]) {
Scanner in=new Scanner(System.in);
int in1= in.nextInt();
int in2= in.nextInt();
int in3= in.nextInt();
m=new int[in3];
for(int i=0;i<in3;i++){
m[i]=in.nextInt();
}
int[] m1 = Arrays.copyOf(m, m.length);
Arrays.sort(m1);
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |