#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long int
#define Max 1000005
#define _fastio ios_base:: sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define ALL(x) x.begin(),x.end()
#define pi acos(-1.0)
#define pb push_back
#define load(array,size) for(ll i=0 ; i<size ; i++) cin>>array[i] ;
#define endl 'n'
#define sc(n) scanf("%d",&n)
#define scan(n) scanf("%lld",&n)
/* speed up */
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define sci(n) scanf("%d",&n);
#define scl(n) scanf("%lld",&n);
#define load1(array,size) for(ll i=1 ; i<=size ; i++) cin>>array[i] ;
#define INF 1LL<<19
#define pll pair<ll,ll>
#define mst(arr,value) memset(arr,value,sizeof(arr));
#define tst() _fastio;int testsalam;cin >> testsalam;while(testsalam--)
#define Mod 100000007
#define YES cout<<"Yes"<<endl;
#define NO cout<<"No"<<endl;
#define fi first
#define se second
struct HASH{
size_t operator()(const pair<int,int>&x)const{
return hash<long long>()(((long long)x.first)^(((long long)x.second)<<32));
}
};
//void inversemod(ll n, ll mod, ll invmod[],ll MOD){for(int i=2; i<=n; ++i) invmod[i]=MOD-MOD/i*invmod[MOD%i]%MOD;}
//void bigmod( ll a, ll b ,ll mod){ll r = 1;a = a%mod;while(b){if( b%2 ) r = (r*a)%mod;b = b/2;a = (a*a)%mod; }return (ll)r;}
string inttostr(ll n){std::stringstream ss;ss << n;string out=ss.str();return out;}
ll stringtoint(string s){istringstream iss (s);ll n;iss >> n;return n;}
template <typename T> T gcd(T a,T b){if(a < 0)return gcd(-a,b);if(b < 0)return gcd(a,-b);return (b == 0)?a:gcd(b,a%b);}
template <typename T> T lcm(T a,T b) {if(a < 0)return lcm(-a,b);if(b < 0)return lcm(a,-b);return a*(b/gcd(a,b));}
typedef vector<ll>vec;
typedef pair<ll,ll> pii;
typedef map<ll,ll>mpll;
typedef set<ll>seet;
typedef tuple<ll,ll,ll>tpl;
typedef unordered_map<pair<int,int>,int,HASH>u_map;
int main()
{
cout<<"Name : Abdus Salam"<<endl;
cout<<"Roll : 1710035"<<endl;
cout<<"nnEnter number of process: "<<endl;
int n;
cin>> n;
int at[n+10],bt[n+10],ct[n+10],ta[n+10],wt[n+10];
vector<pair<int,int>>inp;
cout<<"Enter AT and BT(space separated)"<<endl;
for (int i = 0; i < n; ++i)
{
int a,b;
cin>> a>> b;
inp.push_back({a,b});
}
// sort(inp.begin(),inp.end());
int ctime=0;
int totalTAtime=0,totalWtime=0;
for (int i = 0; i < n; ++i)
{
ctime+=inp[i].second;
ct[i]=ctime;
ta[i]=ct[i]-inp[i].first;
wt[i]=ta[i]-inp[i].second;
totalTAtime+=ta[i];
totalWtime+=wt[i];
}
cout<<"PId |AT |BT |CT | TA |WT"<<endl;
for (int i = 0; i < n; ++i)
{
cout<<i+1<<"%t"<<inp[i].first<<"%t"<<inp[i].second<<"%t"<<ct[i]<<"%t"<<ta[i]<<"%t"<<wt[i]<<endl;
}
cout<<"Average TurnAround time: "<<totalTAtime/n<<endl;
cout<<"Average Wating Time: "<<totalWtime/n<<endl;
}
/*
remember:
ll vs int
array size
case for 1 2 3
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long int
#define Max 1000005
#define _fastio ios_base:: sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define ALL(x) x.begin(),x.end()
#define pi acos(-1.0)
#define pb push_back
#define load(array,size) for(ll i=0 ; i<size ; i++) cin>>array[i] ;
#define endl 'n'
#define sc(n) scanf("%d",&n)
#define scan(n) scanf("%lld",&n)
/* speed up */
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define sci(n) scanf("%d",&n);
#define scl(n) scanf("%lld",&n);
#define load1(array,size) for(ll i=1 ; i<=size ; i++) cin>>array[i] ;
#define INF 1LL<<19
#define pll pair<ll,ll>
#define mst(arr,value) memset(arr,value,sizeof(arr));
#define tst() _fastio;int testsalam;cin >> testsalam;while(testsalam--)
#define Mod 100000007
#define YES cout<<"Yes"<<endl;
#define NO cout<<"No"<<endl;
#define fi first
#define se second
struct HASH{
size_t operator()(const pair<int,int>&x)const{
return hash<long long>()(((long long)x.first)^(((long long)x.second)<<32));
}
};
//void inversemod(ll n, ll mod, ll invmod[],ll MOD){for(int i=2; i<=n; ++i) invmod[i]=MOD-MOD/i*invmod[MOD%i]%MOD;}
//void bigmod( ll a, ll b ,ll mod){ll r = 1;a = a%mod;while(b){if( b%2 ) r = (r*a)%mod;b = b/2;a = (a*a)%mod; }return (ll)r;}
string inttostr(ll n){std::stringstream ss;ss << n;string out=ss.str();return out;}
ll stringtoint(string s){istringstream iss (s);ll n;iss >> n;return n;}
template <typename T> T gcd(T a,T b){if(a < 0)return gcd(-a,b);if(b < 0)return gcd(a,-b);return (b == 0)?a:gcd(b,a%b);}
template <typename T> T lcm(T a,T b) {if(a < 0)return lcm(-a,b);if(b < 0)return lcm(a,-b);return a*(b/gcd(a,b));}
typedef vector<ll>vec;
typedef pair<ll,ll> pii;
typedef map<ll,ll>mpll;
typedef set<ll>seet;
typedef tuple<ll,ll,ll>tpl;
typedef unordered_map<pair<int,int>,int,HASH>u_map;
int main()
{
cout<<"Name : Abdus Salam"<<endl;
cout<<"Roll : 1710035"<<endl;
cout<<"Enter the number of process: "<<endl;
int n;
cin>>n;
map<int,pair<int,int> >v;
int a,b,p,tBT=0;
map<int,int>CT,WT,TAT,AT;
cout<<"Enter process number,arrival time and burst time: "<<endl;
for(int i=1;i<=n;i++)
{
cin>>p>>a>>b;
v[p]={a,b};
tBT+=b;
AT[p]=a;
}
for(int i=0;i<tBT;i++)
{
vector<pair<int,int> >v1;
pair<int,int>pr;
for(auto it:v)
{
pr=it.second;
if(pr.first<=i && pr.second>0)
{
v1.push_back(make_pair(pr.second,it.first));
}
}
if(v1.size()!=0)
{
sort(v1.begin(),v1.end());
pr=v[v1[0].second];
WT[v1[0].second]+=i-pr.first;
a=i+1;
b=pr.second-1;
v[v1[0].second]={a,b};
if(b==0)
{
CT[v1[0].second]=i+1;
TAT[v1[0].second]=i-AT[v1[0].second]+1;
}
}
}
int ct[n+10],wt[n+10],ta[n+10];
for(auto it:CT)
ct[it.first]=it.second;
for(auto it:WT)
wt[it.first]=it.second;
for(auto it:TAT)
ta[it.first]=it.second;
printf(" nn n tProcess t AT t BT t CT t TA t WT t");
printf(" n -----------------------------------------------------");
for (int i=1; i<=n; i++)
{
printf(" n tP%d tt |%d t |%d t |%d t |%d t |%d t",i,v[i].first,v[i].second,ct[i],ta[i],wt[i]);
}
}
/*
4
1 0 8
2 1 4
3 2 9
4 3 5
*/
