non preemptive sjf arrival.txt

#include<bits/stdc++.h>

using namespace std;
int main()
{
    int i,n,j,min,line[10],p[10];
    int B_T[1000],A_V_T[1000],W_T[1000],temp;
    int bt=0,ta=0,sum=0,k=1;
    float avwt=0,wtsum=0;

    cout<<"Enter the Number of processes :";
    cin>>n;
    cout<<"\npro AT BT\n";
    for(i=0; i<n; i++)
    {
        cout<<"p"<<i+1<<" :";
        cin>>A_V_T[i]>>B_T[i];
        p[i]=i+1; //contains process number
    }

    for(i=0; i<n; i++)
    {
        for(j=0; j<n; j++)
        {
            if(A_V_T[i]<A_V_T[j])
            {
                swap(p[j],p[i]);
                swap(A_V_T[j],A_V_T[i]);
                swap(B_T[j],B_T[i]);
            }
        }
    }

    for(j=0; j<n; j++)
    {
        bt=bt+B_T[j];
        min=B_T[k];
        for(i=k; i<n; i++)
        {
            if (bt>=A_V_T[i] && B_T[i]<min)
            {
                swap(p[k],p[i]);
                swap(A_V_T[k],A_V_T[i]);
                swap(B_T[k],B_T[i]);
            }
        }
        k++;
    }

    W_T[0]=0;
    for(i=1; i<n; i++)
    {
        sum=sum+B_T[i-1];

        W_T[i]=sum-A_V_T[i];

        line[i]=W_T[i];

        wtsum=wtsum+W_T[i];
    }

    avwt=(wtsum/n);

    printf("\nProcess Name\tBurst Time\t Arrival Time\t Waiting Time" );
    for(i=0; i<n; i++)
    {
        printf("\np%d\t\t%d\t\t %d\t\t %d",p[i],B_T[i],A_V_T[i],W_T[i]);
    }
    printf("\n\nAVERAGE WAITING TIME : %.2f",avwt);

    printf("\n");

    return 0;
}