1 solutions
-
0
C++ :
#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> #include<string> using namespace std; struct nainiu{ int pi; int ai; }niu[5000]; bool comp(const nainiu &a,const nainiu &b) { return a.pi<b.pi; } int main() { int n,m,s=0,g=0; cin>>n>>m; if(n==0||m==0) { cout<<0;return 0; } for(int i=1;i<=m;i++) cin>>niu[i].pi>>niu[i].ai; sort(niu+1,niu+m+1,comp); for(int i=1;i<=m;i++) for(int j=1;j<=niu[i].ai;j++) { s+=niu[i].pi; g++; if(g==n) { cout<<s<<endl;return 0; } } }
- 1
Information
- ID
- 17923
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- (None)
- Tags
- # Submissions
- 0
- Accepted
- 0
- Uploaded By