#include "iostream"
#include "fstream"
#include "queue"
using namespace std;
/*
最短程序优先
*/
double a[50];
//返回最多能存储的程序个数
double greedy(int n, int len)
{
sort(a, a+n); //按程序长度排序
int i = 0;
int sum = 0;
while(sum<=len && i<len)
sum += a[i++];
i--;
return i;
}
int main()
{
ifstream fin("程序存储.txt");
int n;
cout << "输入程序个数:";
fin >> n; cout << n;
int len;
cout << "\n输入磁带长度:";
fin >> len; cout << len;
cout << "\n输入各程序长度:\n";
int i;
for(i=0; i<n; i++)
{
fin >> a[i];
cout << a[i] << " ";
}
cout << "\n最多可存储的程序个数为:" << greedy(n, len);
cout << endl;
fin.close();
return 0;
}
程序存储问题
最新推荐文章于 2023-06-28 16:35:26 发布