洛谷虚拟赛-5总结

string s;
cin >> s;
int ss = s.size(), ans = 0;
for (int i = 0; i < 26; ++i) t[i] = false;
for (int i = 0; i < ss; ++i)
  if (!t[s[i] - 'A']) t[s[i] - 'A'] = true, ++ans;
cout << ss << ' ' << ans << '\n';

bool t[26];
while (n--) {
  string s;
  cin >> s;
  int ss = s.size(), ans = 0;
  for (int i = 0; i < 26; ++i) t[i] = false;
  for (int i = 0; i < ss; ++i)
    if (!t[s[i] - 'A']) t[s[i] - 'A'] = true, ++ans;
  cout << ss << ' ' << ans << '\n';
}

priority_queue<long long, std::vector<long long>, std::greater<long long>> q;
long long n, m, k;
cin >> n >> m >> k;
for (int i = 0; i < n; ++i) {
  int l;
  bool o;
  cin >> l >> o;
  if (o)
      q.push((m - l) + m);
  else
      q.push(l);
}
long long nowtime;
for (int i = 0; i < k; ++i) {
  nowtime = q.top();
  q.pop();
  q.push(nowtime + m * 2);
}
cout << nowtime + m << '\n';