Question

Scrieti un algoritm in limbaj C , calculati complexitatea, explicati eficenta si executati pe valori pentru a rezolva problema.

O singura statie a unei benzinarii trebuie sa satisfaca cererile a n clienti, n<=100 care sosesc simultan.
Timpul de servire necesar fiecarui client este cunoscut in prealabil.
Se doreste gasirea unui ordini de servire a clientilor astfel incat timpul total de asteptare sa fie minim.

Answer 1

#include<bits/stdc++.h>using namespace std;ifstream in("input.txt");ofstream out("output.txt");typedef long long ll;typedef string str;typedef char chr;#define save1 cin.close()#define save2 cout.close()#define bs bitset#define opt1 ios_base::sync_with_stdio(0)#define opt2 cin.tie(0)#define opt3 cout.tie(0)#define fi first#define se second#define vi vector<int>#define pii pair<int,int>#define pil pair<int,ll>#define pli pair<ll,int>#define pll pair<ll,ll>#define MP make_pair#define pb push_backint v[105];int main(){int n,x,i,ans=0;double ans=0;opt1;opt2;opt3;cin>>n;for(i=1;i<=n;++i)cin>>v[i];sort(v+1,v+n+1);  for(i=1;i<=n;++i)   cout<<v[i]<<" ";save1;save2;return 0;}