Write a program to perform Knapsack Problem using Greedy Solution

#include <stdio.h>
#include <conio.h>
void main() {
    int n, i;
    float w[10], p[10], ratio[10], cap, total = 0;
	clrscr();
    printf("ENTER THE TOTAL NUMBER OF ITEMS TO INCLUDE");
    scanf("%d", &n);
    printf("\nENTER ALL ITEMS WITH ITS WEIGHT AND PROFIT\n");
    for (i = 0; i < n; i++) 
		scanf("%f%f", &w[i],&p[i]);
    printf("\nENTER THE MAXIMUM WEIGHT OF THE BAG\n");
    scanf("%f", &cap);
    for (i = 0; i < n; i++) ratio[i] = p[i] / w[i];
    for (i = 0; i < n - 1; i++)
        for (int j = i + 1; j < n; j++)
            if (ratio[i] < ratio[j]) {
                float t = ratio[i]; ratio[i] = ratio[j]; ratio[j] = t;
                t = w[i]; w[i] = w[j]; w[j] = t;
                t = p[i]; p[i] = p[j]; p[j] = t;
            }
    for (i = 0; i < n && cap > 0; i++) {
        if (w[i] <= cap) {
            total += p[i];
            cap -= w[i];
        } else {
            total += ratio[i] * cap;
            cap = 0;
        }
    }
    printf("Maximum Profit = %.2f\n", total);
	getch();
}