-
Notifications
You must be signed in to change notification settings - Fork 0
/
Game with String.cpp
96 lines (70 loc) · 1.18 KB
/
Game with String.cpp
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
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin>>t;
while(t--)
{
int i,k,ans=0,n;
int a[26]={0};
string s;
cin>>s;
cin>>k;
n=s.length();
for(i=0;i<n;i++)
{
a[s[i]-97]++;
}
sort(a,a+26,greater<int>());
i=0;
for(int j=0;j<k;j++)
{
a[i]--;
sort(a,a+26,greater<int>());
}
for(i=0;i<26;i++)
{
ans+=a[i]*a[i];
}
cout<<ans<<endl;
}
return 0;
}
PRIORITY QUEUE Solution:
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin>>t;
while(t--)
{
int i,k,ans=0,n;
int a[26]={0};
string s;
cin>>s;
cin>>k;
n=s.length();
priority_queue<int> q;
for(i=0;i<n;i++)
{
a[s[i]-97]++;
}
for(i=0;i<26;i++)
q.push(a[i]);
for(int j=0;j<k;j++)
{
int k=q.top();
q.pop();
k=k-1;
q.push(k);
}
while(!q.empty())
{
int m=q.top();
q.pop();
ans+=m*m;
}
cout<<ans<<endl;
}
return 0;
}