-
Notifications
You must be signed in to change notification settings - Fork 0
/
Doi_cho_it_nhat.cpp
50 lines (50 loc) · 1.1 KB
/
Doi_cho_it_nhat.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
#include<bits/stdc++.h>
using namespace std;
int n;
vector<int> a;
int main(){
int t;
cin>>t;
while(t--){
int ans = 0;
cin>>n;
a.resize(n);
for(auto &i:a) cin>>i;
for(int i=0;i<n-1;i++){
int vmin = a[i];
int pmin = i;
for(int j=i+1;j<n;j++){
if(vmin>a[j]){
vmin = a[j];
pmin = j;
}
}
if(pmin!=i){
ans++;
swap(a[i],a[pmin]);
}
}
//p.clear();
/*
p.resize(n);
visit.resize(n);
for(int i=0;i<n;i++){
cin>>a[i];
visit[i] = false;
p[i].val = a[i];
p[i].id = i;
}
sort(p.begin(),p.end(),cmp);
for(int i=0;i<n;i++){
if(i==p[i].id) continue;
else {
swap(p[i].val,p[p[i].id].val);
swap(p[i].id,p[p[i].id].id);
}
if(i!=p[i].id) i--;
ans++;
}
*/
cout<<ans<<endl;
}
}