/ SeriousOJ /

Record Detail

Accepted


  

Code

#include <iostream>
#include <algorithm>
#include <string>

using namespace std;

int main()
{
    int t, n;
	cin >> t;
	while (t-- && cin >> n)
	{
		string s;
		cin >> s;
		string p = s;
		sort(p.begin(), p.end());
		int ans = 0;
		for (int i = 0; i < s.size(); i++)
		{
			ans += (s[i] != p[i]);
		}
		ans /= 2;
		cout << ans << "\n";
	}
}

Information

Submit By
Type
Pretest
Problem
P1016 Swap sort
Language
C++17 (G++ 13.2.0)
Submit At
2023-12-28 14:24:55
Judged At
2024-11-11 03:47:05
Judged By
Score
0
Total Time
0ms
Peak Memory
0 Bytes