CodeForces 349B Color the Fence

先算出最多能有多少个数字，即最大能是多少位，然后再使这个数尽可能大，即最高位越大越好

如

7

5 4 3 2 2 2 3 4 5

输出：766

#include<stdio.h>
#include<iostream>
#include<math.h>
#include<string.h>
#include<iomanip>
#include<stdlib.h>
#include<ctype.h>
#include<algorithm>
#include<deque>
#include<functional>
#include<iterator>
#include<vector>
#include<list>
#include<map>
#include<queue>
#include<set>
#include<stack>
#define CPY(A, B) memcpy(A, B, sizeof(A))
typedef long long LL;
typedef unsigned long long uLL;
const int MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f;
const LL INFF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-9;
const double OO = 1e20;
const double PI = acos (-1.0);
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
using namespace std;
struct num {
    int v, nn;
} a[12];
bool cmp (num a, num b) {
    if (a.v == b.v) {return a.nn > b.nn;}
    return a.v<b.v;
}
bool cmp2 (num a, num b) {
    return a.nn<b.nn;
}
int main() {
    int v; scanf ("%d",&v);
    int len = 0;
    for (int i=1; i<10; i++) {
        scanf ("%d",&a[i].v);
        a[i].nn = i;
    }
    sort (a + 1, a + 10, cmp);//消耗最少，字面值最大
    int temp = a[1].nn;
    len = v / a[1].v;//最大位数
    if (len == 0) {printf ("-1\n");return 0;}//一个数也画不出
    v -= a[1].v*len;//剩余量
    sort (a + 1, a + 10, cmp2);
    for (int i=0; i<len; i++) {
        int j, ans = temp;
        for (j = 9; j > temp; j--) {//从9到目前最省油漆的数遍历
            if (a[j].v - a[temp].v <= v) {
                ans = j;//替换最高位
                v -= a[j].v - a[temp].v;//剩余的油漆
                break;
            }
        }
        printf ("%d", ans);
    }
    printf ("\n");
    return 0;
}