1552A Subsequence Permutation codeofrces solution in cpp;
by ujjal roy
#include<bits/stdc++.h>
using namespace std;
main()
{
int t,i,n;
string s,cs;
cin>>t;
while(t--)
{
int ans=0;
cin>>n;
cin>>s;
cs=s;
sort(s.begin(),s.end());
for(i=0;i<n;i++)
{
if(s[i]!=cs[i]) ans++;
}
cout<<ans<<endl;
}
return 0;
}
0 Comments