Submission #944376

---

Source Code Expand

#include <iostream>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <algorithm>
#include <string>
#include <sstream>
#include <iomanip>
#include <functional>

using namespace std;

int main() {

    int k,t;
    int sum=0;
    std::cin >> k >> t ;
    vector<int> a(t);
    for (size_t i = 0; i < t; i++) {
      std::cin >> a[i];
      if (2*a[i]-1>k) {
        sum+=2*a[i]-1-k;
      }
    }
    std::cout << sum << std::endl;
    return 0;
}

Submission Info

Judge Result