codeforce #499 div2 A

代码写的好优雅啊。。

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
int main()
{
    int n,k;
    scanf("%d%d",&n,&k);
    string s;
    cin>>s;
    sort(s.begin(),s.end());
    int len=0;
    int ans=0;
    char last='a'-2;
    for(int i=0;i<n;i++) {
        if(s[i]-last>=2) {
            ans+=s[i]-'a'+1;
            last=s[i];
            len++;
            if(len>=k) {
                printf("%d\n",ans); return 0;
            }
        }
    }
    cout<<-1<<endl;
}