erfanul007

Light OJ 1166

Jan 12th, 2019
102
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.56 KB | None | 0 0
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3.  
  4. typedef long long int ll;
  5. typedef unsigned long long int ull;
  6. typedef vector<int> vi;
  7. typedef vector<ll> vll;
  8. typedef vector<vi> vvi;
  9. typedef pair<int,int> pii;
  10. typedef vector< pii > vpii;
  11. typedef set<int> sti;
  12.  
  13. #define pb push_back
  14. #define pob pop_back
  15. #define mp make_pair
  16. #define ff first
  17. #define ss second
  18. #define loop1(i,n) for(int i=1; i<=int(n); i++)
  19. #define loop(i,y) for(int i=0; i<int(y); i++)
  20. #define rloop(i,y) for(int i=int(y); i>0; i--)
  21. #define rloop1(i,y) for(int i=int(y)-1; i>=0; i--)
  22. #define read() freopen("input.txt", "r", stdin)
  23. #define write() freopen("output.txt", "w", stdout)
  24. #define cspf(i) printf("Case %d: ", i)
  25. /// Constants
  26. #define eps 1e-9
  27. #define PI acos(-1.0) // 3.1415926535897932
  28.  
  29. int main()
  30. {
  31. int t;
  32. cin>>t;
  33. loop1(i,t){
  34. int n,a[109],mn,cnt=0,x;
  35. cin>>n;
  36. loop(j,n)
  37. cin>>a[j];
  38. loop(j,n){
  39. mn=a[j];
  40. for(int k=j+1;k<n;k++){
  41. if(a[k]<mn){
  42. mn=a[k];
  43. x=k;
  44. }
  45. }
  46. if(mn!=a[j]){
  47. swap(a[j],a[x]);
  48. cnt++;
  49. }
  50. }
  51. cspf(i);
  52. cout<<cnt<<endl;
  53. }
  54. return 0;
  55. }
Add Comment
Please, Sign In to add comment