做一个月也是真辛苦了
by 哔哩哔哩 @ 2018-09-22 15:53:16
@[哔哩哔哩](/space/show?uid=41868) 8月多开始做，平均3天看一次……
by Crystron_Halqifibrax @ 2018-09-22 15:55:16
30分的不止你一个qaq
```cpp
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<cstring>
using namespace std;
int n,m,k,kk[105],ai,bi,a[105][210],j[210],b[210],ans;
bool cmp(int a,int b){
if(a>b)return true;
else return false;
}
int main(){
cin>>n>>m>>k;
for(int i=1;i<=k;i++)cin>>kk[i];
for(int i=1;i<=n;i++){
cin>>ai>>bi;
a[bi][++j[bi]] = ai;
}
for(int i=1;i<=k;i++){
for(int x=1;x<=j[i];x++)b[x] = a[i][x];
sort(b+1,b+j[i]+1,cmp);
for(int y=1;y<=kk[i];y++){
ans+=b[y];
}
memset(b,0,sizeof(b));
}
cout<<ans;
return 0;
}
```
by 子谦 @ 2018-10-31 20:29:40
+1
```c
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;int a[102][102],n,m,k,b,c,ans[102],q[102],s;
int main(){
cin>>n>>m>>k;
for(int i=1;i<=k;++i){
cin>>q[i];
}
for(int i=1;i<=n;++i){
cin>>b>>c;
a[c][++a[c][0]]=b;
}
for(int i=1;i<=k;++i){
sort(a[i]+1,a[i]+a[i][0]+1);
for(int j=a[i][0];j>=a[i][0]-q[i]+1&&j>=1;--j)if(a[i][j])ans[++ans[0]]=a[i][j];
}
sort(ans+1,ans+ans[0]+1);
for(int i=ans[0];i>=ans[0]-m+1,i>=1;--i)s+=ans[i];
cout<<s;
}
```
by gyh20 @ 2019-08-23 11:34:59