#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
const int inputSize = n * (n + 1) / 2;
int col = 0;
int row = 2;
int rowSize = 2;
int minVal;
cin >> minVal;
for (int i = 1; i < inputSize; i++) {
int val;
cin >> val;
int cost = (col + 1) * (rowSize - col);
if (cost <= k)
minVal = min(minVal, val);
col++;
if (col == rowSize) {
col = 0;
row++;
rowSize++;
}
}
cout << minVal;
}
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 | #include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n, k; cin >> n >> k; const int inputSize = n * (n + 1) / 2; int col = 0; int row = 2; int rowSize = 2; int minVal; cin >> minVal; for (int i = 1; i < inputSize; i++) { int val; cin >> val; int cost = (col + 1) * (rowSize - col); if (cost <= k) minVal = min(minVal, val); col++; if (col == rowSize) { col = 0; row++; rowSize++; } } cout << minVal; } |
English