Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|---|
12414 | 陈颖钧 | 购买贺年卡 | C++ | Accepted | 100 | 1 MS | 260 KB | 444 | 2025-07-12 14:50:42 |
#include<bits/stdc++.h> using namespace std; int n,m,i; struct card{ int q; int f; }a[250]; bool cmp(card a,card b){ if(a.q<b.q){ return true; }else{ return false; } } int main(){ cin>>n>>m; for(i=0;i<m;i++){ cin>>a[i].q>>a[i].f; } sort(a,a+m,cmp); int sum=0,price=0; for(i=0;i<m;i++){ sum+=a[i].f; price+=a[i].q*a[i].f; if(sum>n){ price-=(sum-n)*a[i].q; break; } } cout<<price; }