pepcoding.com 21/10/21 sortK-sortedArray

code.cpp

#include<bits/stdc++.h>
using namespace std;

int main(){
	int n;
	cin >> n;
	int arr[n];
	for(int i=0;i<n;i++){
		cin >> arr[i];
	}
	int k;
	cin >> k;
	priority_queue<int,vector<int>,greater<int>> p;
	for(int i=0;i<=k;i++){
		p.push(arr[i]);
	}
	for(int i=k+1;i<n;i++){
		cout << p.top() << endl;
		p.pop();
		p.push(arr[i]);
	}
	while(p.size()>0){
		cout << p.top()<< endl;
		p.pop();
	}

}

code.py

from heapq import heapify,heappush,heappop
def sort(l,n,k):
    heap=l[:k+1]
    heapify(heap)
    j=0
    for i in range(k+1,n):
        print(heappop(heap))
        heappush(heap,l[i])
    while len(heap)!=0:
        print(heappop(heap))
  
def main():
    ints = []
    n = int(input())
    for i in range(0,n):
        ele=int(input())
        ints.append(ele)
    size = len(ints)

    k=int(input())
    sort(ints, size, k)
    
if __name__ == '__main__':
    main()

snippet.cpp

#include <bits/stdc++.h>
using namespace std;
 
int sortK(int arr[], int n, int k){

//write your code here


}

int main()
{
    int n;
    cin>>n;
    int arr[n];
    for(int i = 0 ; i<n ; i++){
        int data;
        cin>>data;
        arr[i]=data;
    }
    int k;
    cin>>k;
    sortK(arr, n, k);
    return 0;
}

snippet.py

from heapq import heapify,heappush,heappop
def sort(l,n,k):
    #write your code here

def main():
    ints = []
    n = int(input())
    for i in range(0,n):
        ele=int(input())
        ints.append(ele)
    size = len(ints)

    k=int(input())
    sort(ints, size, k)
    
if __name__ == '__main__':
    main()