Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- struct meh
- {
- int col,grad;
- };
- meh a[101];
- int st[100],k,m,n,ap[1001],sum[1001],Max,rez[1001];
- bool sol(int k)
- {
- if(k==m)
- return 1;
- return 0;
- }
- bool valid(int k)
- {
- if(a[st[k-1]].col==a[st[k]].col)
- return 0;
- sum[k]=sum[k-1]+a[st[k]].grad;
- return 1;
- }
- void backit(int k)
- {
- for(int i=1;i<=n;++i)
- {
- if(!ap[i])
- {
- ap[i]=1;
- st[k]=i;
- if(valid(k))
- if(sol(k))
- {
- if(a[st[k]].col!=a[st[1]].col)
- if(sum[k]>Max)
- {
- Max=sum[k];
- for(int j=1;j<=m;++j)
- rez[j]=st[j];
- }
- }
- else
- backit(k+1);
- ap[i]=0;
- }
- }
- }
- int main()
- {
- freopen("colier.in","r",stdin);
- freopen("colier.out","w",stdout);
- scanf("%d %d",&n,&m);
- for(int i=1;i<=n;++i)
- scanf("%d%d",&a[i].col,&a[i].grad);
- backit(1);
- for(int i=1;i<=m;++i)
- printf("%d ",rez[i]);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement