-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmanage forum.java
111 lines (78 loc) · 2.34 KB
/
manage forum.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
//Enter code here
import java.util.*;
import java.io.*;
class Main{
static class FastReader
{
BufferedReader br;
StringTokenizer st;
public FastReader()
{
br = new BufferedReader(new InputStreamReader(System.in));
}
String next()
{
while (st == null || !st.hasMoreElements()){
try { st = new StringTokenizer(br.readLine()); }
catch (IOException e) { e.printStackTrace(); }
}
return st.nextToken();
}
int nextInt() { return Integer.parseInt(next()); }
long nextLong() { return Long.parseLong(next()); }
double nextDouble(){ return Double.parseDouble(next()); }
String nextLine(){
String str = "";
try { str = br.readLine(); }
catch (IOException e) { e.printStackTrace(); }
return str;
}
}
public static void main(String[] args){
int re=0;
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
sc.nextLine();
String[] t1=sc.nextLine().split(" ");
String[] t2=sc.nextLine().split(" ");
int[] e1=new int[t1.length];
int[] arr2=new int[t2.length];
for(int i=0;i<t1.length;i++)
{
e1[i]=Integer.parseInt(t1[i]);
}
for(int i=0;i<t2.length;i++)
{
arr2[i]=Integer.parseInt(t2[i]);
}
callWala(e1,arr2,n);
}
public static void callWala(int[] e1, int[] arr2,int n)
{
Arrays.sort(arr2);
Arrays.sort(e1);
int p=0;
int q=0;
int a=0;
int rr=0;
while(p<e1.length && q<arr2.length){
if(e1[p]<=arr2[q]) {
a++;
p++;
}
else
{
a--;
q++;
}
rr= Math.max(rr,a);
}
if(rr<=n)
{
System.out.println("Possible");
}
else{
System.out.println("Not Possible");
}
}
}