- #include <stdio.h>
- int main()
- {
- int n, r;
- scanf("%d%d",&n,&r);
- int avail[r];
- int alloc[n][r],max[n][r];
- for(int i=0;i<r;i++)
- {
- scanf("%d",&avail[i]);
- }
- for(int i=0;i<n;i++)
- {
- for(int j=0;j<r;j++)
- {
- scanf("%d",&alloc[i][j]);
- }
- }
- for(int i=0;i<n;i++)
- {
- for(int j=0;j<r;j++)
- {
- scanf("%d",&max[i][j]);
- }
- }
- int f[n], ans[n], ind = 0;
- for (int k = 0; k < n; k++) {
- f[k] = 0;
- }
- int need[n][r];
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < r; j++)
- need[i][j] = max[i][j] - alloc[i][j];
- }
- int y = 0;
- for (int k = 0; k < 5; k++) {
- for (int i = 0;i < n; i++) {
- if (f[i] == 0) {
- int flag = 0;
- for (int j = 0; j < r; j++) {
- if (need[i][j] > avail[j]){
- flag = 1;
- break;
- }
- }
- if (flag == 0) {
- ans[ind++] = i;
- for (y = 0; y < r; y++)
- avail[y] += alloc[i][y];
- f[i] = 1;
- }
- }
- }
- }
- for (int i = 0; i < n - 1; i++)
- printf(" P%d ->", ans[i]);
- printf(" P%d", ans[n - 1]);
- return (0);
- }
[text] muwahhahah
Viewer
Editor
You can edit this paste and save as new:
File Description
- muwahhahah
- Paste Code
- 05 Jun-2023
- 1.11 Kb
You can Share it:
Latest Code Pastes