-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathA.py
110 lines (100 loc) · 3.24 KB
/
A.py
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
#===========Template===============
from io import BytesIO, IOBase
import sys,os
inpl=lambda:list(map(int,input().split()))
inpm=lambda:map(int,input().split())
inpi=lambda:int(input())
inp=lambda:input()
rev,ra,l=reversed,range,len
P=print
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
def input(): return sys.stdin.readline().rstrip("\r\n")
#=========I/p O/p ========================================#
from bisect import bisect_left as bl
from bisect import bisect_right as br
import sys,operator,math,operator
from collections import Counter
import random
#==============To chaliye shuru krte he ====================#
n=inpi()
li=inpl()
li.sort()
c,ans=0,0
for i in ra(n):
if li[c]<li[i]:
c+=1
ans+=1
P(ans)
# for i in ra(n):
# idx=br(li1,li[i])
# if idx==n:
# omap[li1[j]]-=1
# arr.append(li1[j])
# if omap[li1[j]]==0:
# del omap[li1[j]]
# j+=1
# else:
# if li1[idx] in omap:
# omap[li1[idx]]-=1
# arr.append(li1[idx])
# if omap[li1[idx]]==0:
# del omap[li1[idx]]
# ans+=1
# else:
# while idx!=n:
# idx=br(li1,li1[idx])
# if idx!=n:
# if li1[idx] in omap:
# break
# else:
# break
# if idx!=n:
# omap[li1[idx]]-=1
# arr.append(li1[idx])
# if omap[li1[idx]]==0:
# del omap[li1[idx]]
# ans+=1
# else:
# omap[li1[j]]-=1
# arr.append(li1[j])
# if omap[li1[j]]==0:
# del omap[li1[j]]
# j+=1
# P(ans)