加工生产调度

根本不会。。。

http://codevs.cn/problem/3008/

题解：

https://www.cnblogs.com/f91og/p/6024706.html

https://blog.csdn.net/liufeng_king/article/details/8678316

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<vector>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
struct Q
{
    int x,y,n;
}q[1010],ans[1010];
bool operator<(const Q &a,const Q &b)
{
    return min(a.x,a.y)<min(b.x,b.y);
}
int tl,tr,n;
int main()
{
    int i,j,t;
    scanf("%d",&n);tl=0;tr=n+1;
    for(i=1;i<=n;i++)    scanf("%d",&q[i].x);
    for(i=1;i<=n;i++)    scanf("%d",&q[i].y),q[i].n=i;
    for(i=1;i<=n;++i)
        for(j=i+1;j<=n;++j)
            if(q[j]<q[i])
                swap(q[i],q[j]);
    for(i=1;i<=n;i++)
    {
        t=min(q[i].x,q[i].y);
        if(t==q[i].x)    ans[++tl]=q[i];
        else    ans[--tr]=q[i];
    }
    int tm=0,an=0;
    for(i=1;i<=n;i++)
    {
        tm+=ans[i].x;
        an=max(an,tm)+ans[i].y;
    }
    printf("%d
",an);
    return 0;
}

---

http://210.33.19.103/contest/966/problem/2

（玄学数据，不会字典序，然而数据也不是字典序）

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<vector>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
struct Q
{
    int x,y,n;
}q[1010],ans[1010];
bool operator<(const Q &a,const Q &b)
{
    return min(a.x,a.y)<min(b.x,b.y);
}
int tl,tr,n;
int main()
{
    int i,j,t;
    scanf("%d",&n);tl=0;tr=n+1;
    for(i=1;i<=n;i++)    scanf("%d",&q[i].x);
    for(i=1;i<=n;i++)    scanf("%d",&q[i].y),q[i].n=i;
    for(i=1;i<=n;++i)
        for(j=i+1;j<=n;++j)
            if(q[j]<q[i])
                swap(q[i],q[j]);
    for(i=1;i<=n;i++)
    {
        t=min(q[i].x,q[i].y);
        if(t==q[i].x)    ans[++tl]=q[i];
        else    ans[--tr]=q[i];
    }
    int tm=0,an=0;
    for(i=1;i<=n;i++)
    {
        tm+=ans[i].x;
        an=max(an,tm)+ans[i].y;
    }
    printf("%d
",an);
    for(i=1;i<=n;i++)    printf("%d ",ans[i].n);
    return 0;
}