P1208 [USACO1.3]混合牛奶 Mixing Milk - 华师一附中OI组

#include<iostream>
#include<algorithm>
using namespace std;
int n,m,ans;
struct node
{
int c,a;
}p[5010];
bool cmp(node x,node y)
{
return x.c<y.c;
}
int main()
{
cin>>n>>m;
for(int i=1;i<=m;i++)
cin>>p[i].c>>p[i].a;
sort(p+1,p+m+1,cmp);
int j=1;
while(n-p[j].a>0)
{
n-=p[j].a;
ans+=p[j].a*p[j++].c;
}
ans+=n*p[j].c;
cout<<ans<<endl;
return 0;
}

复制代码

#include<iostream>
#include<algorithm>
using namespace std;
int all,n,ans;
struct milk
{
int price;
int s;
}a[5001];
bool operator<(milk &x,milk &y)
{
return x.price<y.price;
}
int main()
{
cin>>all>>n;
for(int i=1;i<=n;i++)cin>>a[i].price>>a[i].s;
sort(a+1,a+n+1);
for(int i=1;all;i++)
{
ans+=a[i].price*min(a[i].s,all);
all-=min(a[i].s,all);
}
cout<<ans;
return 0;
}

复制代码

#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-fstrict-overflow")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-skip-blocks")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
int n,m,i;
struct farmer
{
int p,a;
}f[5010];
ll c;
bool cmp(farmer x,farmer y){return x.p<y.p;}
int getint()
{
int w = 0, q = 0;
char c = getchar();
while ((c < '0' || c > '9') && c != '-') c = getchar();
if (c == '-') q = 1, c = getchar();
while (c >= '0' && c <= '9') w = w * 10 + c - '0', c = getchar();
return q ? -w : w;
}
int main()
{
n=getint();m=getint();
for(i=1;i<=m;i++) f[i].p=getint(),f[i].a=getint();
sort(f+1,f+m+1,cmp);
i=1;while(n>0)
{
if(n>f[i].a) {n-=f[i].a;c+=f[i].p*f[i].a;i++;}
else {c+=n*f[i].p;n=0;}
}
cout<<c;
return 0;
}

复制代码

//
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#define maxm 5010
using namespace std;
int n,m;
int ans;
struct node{
int maxv,money;
}farmer[maxm];
bool cmp(node a,node b)
{
return a.money<b.money;
}
void read()
{
cin>>n>>m;
for(int i=1;i<=m;i++)
cin>>farmer[i].money>>farmer[i].maxv;
return;
}
void work()
{
int pos=0;
read();
sort(farmer+1,farmer+1+m,cmp);
while(n>0){
pos++;
if(n>=farmer[pos].maxv) n-=farmer[pos].maxv,ans+=farmer[pos].money*farmer[pos].maxv;
else ans+=farmer[pos].money*n,n=0;
}
cout<<ans;
return;
}
int main()
{
work();
return 0;
}

复制代码