Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- int main()
- {
- long long int a,b,d,e,n,m,l,totalwork,mn,mx,sum,i,j,k,t,cas,ekok,half;
- string s;
- char c;
- cin>>t;
- for(cas=1;cas<=t;cas++)
- {
- cin>>n>>m>>l;
- vector<pair<long long int,string>>v;
- while(l--)
- {
- while(cin>>c && c!=':')
- s+=c;
- scanf("%lld,%lld",&ekok,&half);
- totalwork=n-m;
- mn=(totalwork)*ekok;
- a=n,sum=0;
- while(a/2>=m)
- {
- a/=2;
- sum+=half;
- b=sum+(a-m)*ekok;
- mn=min(mn,b);
- }
- v.push_back(make_pair(mn,s));
- s.clear();
- }
- sort(v.begin(),v.end());
- cout<<"Case "<<cas<<endl;
- for(i=0;i<v.size();i++)
- {
- cout<<v[i].second<<" "<<v[i].first<<endl;
- }
- v.clear();
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement