CSE330 ETP

CSE330ETP.cpp

#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

int comparefun (const void *a, const void * b) {
	return ( *(int *)a - *(int *)b );
}
void find(int a[], int n, int k){
	int ll, rr;
	qsort (a, n, sizeof(a[0]), comparefun);
	for (int i = 0; i < n - 3; i++){
		for (int j = i+1; j < n - 2; j++){ 
			ll = j + 1;
			rr = n - 1;
			while (ll < rr){
				if( a[i] + a[j] +a[ll] + a[rr] == k){
					cout<<a[i]<<" "<<a[j]<<" "<<a[ll]<<" "<<a[rr]<<" $";
					ll++; rr--;
				}
				else if (a[i] + a[j] + a[ll] + a[rr] < k)
					ll++;
				else
					rr--;
			}
		}
	}
}
int main() {
	int t;
	cin>>t;
	for(int k=0;k<t;k++){
		int n,q;
		cin>>n>>q;
		int a[n];
		for(int i=0;i<n;i++)
			cin>>a[i];
		find(a,n,q);
		cout<<endl;
	}
	return 0;
}

//Second

#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

int main() {
    int T;
    cin >> T;
    while(T--){
        int N;
       	cin>>N;
        int arr[N], step = 0, j;
        for(int i=0;i<N;i++)
        	cin >> arr[i];
        for(int i=1;i<N;i++){
            if(arr[i]<arr[i-1]){
                int temp=arr[i];
                for( j=i;arr[j]>=arr[i];j--)
                    arr[j]=arr[j-1];
                arr[j]=temp;
            step++;
            }
        }
        cout<<step<<endl;
    }
    return 0;
}