- #include<stdio.h>
- struct
- {
- int w,p;
- } a[1000],t;
- void f(int l,int r)
- {
- int i=l; int j=r;
- t=a[i];
- if(i>=j) return;
- while(i<j)
- {
- while(i<j&&t.w<=a[j].w) j--;
- a[i]=a[j];
- while(i<j&&t.w>=a[i].w) i++;
- a[j]=a[i];
- }
- a[i]=t;
- f(l,i-1);
- f(i+1,r);
- }
- int main()
- {
- int n,m,i,sum,j;
- while(~scanf("%d %d",&n,&m))
- {
- sum=0;
- for(i=0; i<n; i++)
- {
- scanf("%d %d",&a[i].w,&a[i].p);
- }
- for(i=0; i<n-1; i++)
- {
- for(j=i+1; j<n; j++)
- {
- f(0,n-1);
- if(a[i].w==a[j].w&&a[i].p<a[j].p)
- {
- t=a[j];
- a[j]=a[i];
- a[i]=t;
- }
- }
- }
- for(i=0; i<m; i++)
- {
- sum+=a[i].p;
- }
- printf("%d\n",sum);
- }
- return 0;
- }
Re: Untitled
From 李清璇, 3 Years ago, written in Plain Text, viewed 404 times.
This paste is a reply to Untitled from 李清璇
- view diff
URL http://axuhongbo.top/paste/view/93736d70
Embed
Download Paste or View Raw
— Expand Paste to full width of browser