-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathselectionGift.java
More file actions
83 lines (66 loc) · 1.64 KB
/
selectionGift.java
File metadata and controls
83 lines (66 loc) · 1.64 KB
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
package coding;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
//import java.util.HashMap;
import java.util.Scanner;
import java.util.StringTokenizer;
class InputReader {
public BufferedReader reader;
public StringTokenizer tokenizer;
public InputReader(InputStream stream) {
reader = new BufferedReader(new InputStreamReader(stream), 32768);
tokenizer = null;
tokenizer = null;
}
public String next() {
while (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
tokenizer = new StringTokenizer(reader.readLine());
} catch (IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken();
}
public int nextInt() {
return Integer.parseInt(next());
}
public long nextLong() {
return Long.parseLong(next());
}
}
public class selectionGift {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
// HashMap<Integer, Boolean> hm=new HashMap<>();
int m=sc.nextInt();
int arr[]=new int[m];
int ans[]=new int[n];
for (int i = 0; i < arr.length; i++) {
arr[0]=sc.nextInt();
ans[arr[0]-1]++;
}
int min=Integer.MAX_VALUE;
int res=0;
int minCOunt=1;
for (int i = 0; i < ans.length; i++) {
if(ans[i]==0) {
res++;
}
if(ans[i]<min) {
min=ans[i];
minCOunt=1;
}else if(ans[i]==min){
minCOunt++;
}
}
if(res>0) {
System.out.println(res);
}else {
System.out.println(minCOunt);
}
}
}