8
60 70 80 90 30 40 10 20

60 1
70 2
80 3
90 4
30 1
40 5
10 1
20 2
5

6
100 90 80 70 60 50

100 1
90 2
80 3
70 4
60 5
50 6
6

1
2

2 1
1

#include <cstdio> #include <cstring> const int maxn = 1017; int a[maxn], b[maxn], c[maxn]; void init() { for(int i = 0; i < maxn; i++) b[i] = 100; } void solve(int n) { int maxx = 0; for(int i = 1; i <= n; i++) { for(int j = 1; ; j++) { if(b[j]>=a[i]) { b[j] -= a[i]; if(maxx < j) maxx = j; c[i] = j; break; } } } for(int i = 1; i <= n; i++) { printf("%d %d ",a[i],c[i]); } printf("%d ",maxx); } int main() { int n; while(~scanf("%d",&n)) { init(); for(int i = 1; i <= n; i++) { scanf("%d",&a[i]); } solve(n); } return 0; }