-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathEqual Elements.cpp
More file actions
64 lines (51 loc) · 864 Bytes
/
Equal Elements.cpp
File metadata and controls
64 lines (51 loc) · 864 Bytes
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
/*
***** !!!!! JAI SHREE KRISHNA !!!!! *****
Date - 8th March 2023
Code by - Abhinav Anand
Problem link -> https://www.codechef.com/problems/EQUALELE
*/
#include <iostream>
#include <algorithm>
#include <bits/stdc++.h>
#define ll long long int
#define endl "\n"
using namespace std;
bool isprime(int n)
{
for(int i=2;i<=sqrt(n);i++)
{
if(n%i==0)
return false;
}
return true;
}
void solve()
{
int n;
cin>>n;
int a[n];
map<int,int> m;
for(int i=0;i<n;i++)
{
cin>>a[i];
m[a[i]]++;
}
vector<int> v;
for(auto &it:m)
{
if(it.second>=1)
v.push_back(it.second);
}
sort(v.begin(),v.end());
int k=v[v.size()-1];
cout << n-k << endl;
}
int main() {
ll t;
cin>>t;
while(t--)
{
solve();
}
return 0;
}