开发笔记:CODE[VS]1621混合牛奶USACO

1 #include<iostream>
2 #include
3 #include
4 #include
5 #include
6 using namespace std;
7
8 int n,m;
9 long long ans,q;
10
11 struct node{
12 int pr,cou;
13 }a[5002];
14
15 bool cmp(node x,node y)
16 {
17 return x.pr <y.pr ;
18 }
19
20 int main()
21 {
22 scanf("%d%d",&n,&m);
23 for(int i=1;i<=m;++i)
24 scanf("%d%d",&a[i].pr ,&a[i].cou );
25 sort(a+1,a+m+1,cmp);
26 for(int i=1;i<=m;++i)
27 {
28 if(n-q<=a[i].cou )
29 {
30 ans+=a[i].pr *(n-q);
31 break;
32 }
33 if(q==n) break;
34 q+=a[i].cou ;
35 ans+=a[i].pr *a[i].cou ;
36 }
37 printf("%lld",ans);
38 return 0;
39 }