aboutsummaryrefslogtreecommitdiff
path: root/contests/Round849/G1/main.cpp
diff options
context:
space:
mode:
authoromagdy7 <omar.professional8777@gmail.com>2023-07-24 13:11:33 +0300
committeromagdy7 <omar.professional8777@gmail.com>2023-07-24 13:11:33 +0300
commit6b548332bfc6469756526002971c422f43f86d0a (patch)
tree261fde23f07c3e20cea375030f0c52863b59228c /contests/Round849/G1/main.cpp
parentcff8cae22ee9c25d193ff976143813f93e658e55 (diff)
downloadcompetitive-programming-6b548332bfc6469756526002971c422f43f86d0a.tar.xz
competitive-programming-6b548332bfc6469756526002971c422f43f86d0a.zip
Removed some empty *.cpp files and Solved some new problems
Diffstat (limited to 'contests/Round849/G1/main.cpp')
-rwxr-xr-xcontests/Round849/G1/main.cpp108
1 files changed, 108 insertions, 0 deletions
diff --git a/contests/Round849/G1/main.cpp b/contests/Round849/G1/main.cpp
new file mode 100755
index 0000000..fa55787
--- /dev/null
+++ b/contests/Round849/G1/main.cpp
@@ -0,0 +1,108 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+using ll = long long;
+using pi = pair<int, int>;
+using vpi = vector<pi>;
+using vi = vector<int>;
+using vll = vector<long long>;
+using mpii = map<int, int>;
+using mpll = map<ll, ll>;
+using db = long double;
+
+#define pb push_back
+#define all(x) (x).begin(), (x).end()
+#define rall(x) (x).rbegin(), (x).rend()
+#define lb lower_bound
+#define ub upper_bound
+
+const int MOD = (int)1e9 + 7;
+const db PI = acos((db)-1);
+const int dx[4]{1, 0, -1, 0};
+const int dy[4]{0, 1, 0, -1};
+
+//pretty printing
+template<typename K, typename V>
+void printm(const map<K, V> &mp) {
+ cerr << "{" << endl;
+ for (auto p : mp) {
+ cerr << " { " << p.first << " : " << p.second << " }\n";
+ }
+ cerr << "}" << endl;
+}
+template<typename T>
+void printv(const vector<T> &v) {
+ cerr << "[";
+ for (int i = 0; i < v.size(); i++) {
+ if (i == v.size() - 1) {
+ cerr << v[i];
+ } else {
+ cerr << v[i] << ", ";
+ }
+ }
+ cerr << "]\n";
+}
+
+template<typename T>
+void printvv(const vector<vector<T>> &v) {
+ cerr << "[\n";
+ for (auto &vec : v) {
+ cout << " ";
+ printv(vec);
+ }
+ cerr << "]\n";
+}
+void print() {
+ cerr << "\n";
+}
+
+template<typename T, typename... TS>
+void print(T val, TS... vals) {
+ cerr << val << " ";
+ print(vals...);
+}
+
+
+/* stuff you should look for:
+ ---------------------------
+ * special cases (n=1?)
+ * int overflow, array bounds
+ * do smth instead of nothing and stay organized
+ * WRITE STUFF DOWN
+ * DON'T GET STUCK ON ONE APPROACH
+ */
+
+//
+void solve() {
+ int n, c;
+ cin >> n >> c;
+ vi v(n);
+ for (int i = 0; i < n; i++) {
+ int x;
+ cin >> x;
+ v[i] = x + i + 1;
+ }
+ sort(all(v));
+ int ans = 0;
+ for (auto x : v) {
+ if (c - x >= 0) {
+ ans++;
+ } else {
+ break;
+ }
+ c -= x;
+ }
+ cout << ans << '\n';
+}
+
+int main () {
+ ios_base::sync_with_stdio(false);
+ cin.tie(NULL);
+ int tt;
+ cin >> tt;
+ while(tt--) {
+ solve();
+ }
+}
+
+