A. Stages
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Natasha is going to fly to Mars. She needs to build a rocket, which consists of several stages in some order. Each of the stages is defined by a lowercase Latin letter. This way, the rocket can be described by the string — concatenation of letters, which correspond to the stages.
There are nn stages available. The rocket must contain exactly kk of them. Stages in the rocket should be ordered by their weight. So, after the stage with some letter can go only stage with a letter, which is at least two positions after in the alphabet (skipping one letter in between, or even more). For example, after letter 'c' can't go letters 'a', 'b', 'c' and 'd', but can go letters 'e', 'f', ..., 'z'.
For the rocket to fly as far as possible, its weight should be minimal. The weight of the rocket is equal to the sum of the weights of its stages. The weight of the stage is the number of its letter in the alphabet. For example, the stage 'a 'weighs one ton,' b 'weighs two tons, and' z' — 2626 tons.
Build the rocket with the minimal weight or determine, that it is impossible to build a rocket at all. Each stage can be used at most once.
Input
The first line of input contains two integers — nn and kk (1≤k≤n≤501≤k≤n≤50) – the number of available stages and the number of stages to use in the rocket.
The second line contains string ss, which consists of exactly nn lowercase Latin letters. Each letter defines a new stage, which can be used to build the rocket. Each stage can be used at most once.
Output
Print a single integer — the minimal total weight of the rocket or -1, if it is impossible to build the rocket at all.
Examples
input
Copy
5 3 xyabd
output
Copy
29
input
Copy
7 4 problem
output
Copy
34
input
Copy
2 2 ab
output
Copy
-1
input
Copy
12 1 abaabbaaabbb
output
Copy
1
Note
In the first example, the following rockets satisfy the condition:
- "adx" (weight is 1+4+24=291+4+24=29);
- "ady" (weight is 1+4+25=301+4+25=30);
- "bdx" (weight is 2+4+24=302+4+24=30);
- "bdy" (weight is 2+4+25=312+4+25=31).
Rocket "adx" has the minimal weight, so the answer is 2929.
In the second example, target rocket is "belo". Its weight is 2+5+12+15=342+5+12+15=34.
In the third example, n=k=2n=k=2, so the rocket must have both stages: 'a' and 'b'. This rocket doesn't satisfy the condition, because these letters are adjacent in the alphabet. Answer is -1.
题目大意：现有n个零件，要选m个，使零件的重量是递增的且不能选重量相邻的，要使选择的m个零件重量最小，重量为对应的序号如a—1，z—26，
思路：从小到大排序，按规则选择m个
代码：
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
char s[105];
int main()
{
int n,m;
scanf("%d%d",&n,&m);
scanf("%s",s);
sort(s,s+n);
int sum=s[0]-'a'+1,k=1;
char ans=s[0];
for(int i=1;i<n;i++)
{
if(k==m) break;
if(s[i]-ans>1){k++;ans=s[i];sum=sum+s[i]-'a'+1;}
}
if(k==m)printf("%d\n",sum);
else printf("-1\n");
return 0;
}