#include <bits/stdc++.h> using namespace std; #define PB push_back #define SZ(x) int((x).size()) #define REP(i, n) for(int i=0,_=(n);i<_;++i) #define FOR(i, a, b) for(int i=(a),_=(b);i<=_;++i) #define FORD(i, a, b) for(int i=(a),_=(b);i>=_;--i) #ifdef DEBUG #define DEB(x) (cerr << x) #else #define DEB(x) #endif typedef long long ll; typedef vector<int> vi; typedef pair<int, int> pii; const int INF = 1e9 + 9; void inline one() { int n, k; cin >> n >> k; int best = INF; REP(i, n) { FOR(j, 0, i) { int x; cin >> x; int required = (j + 1) * (i - j + 1); if (k >= required) { best = min(best, x); } } } cout << best << "\n"; } int main() { ios::sync_with_stdio(false); cin.tie(0); //int z; cin >> z; while(z--) one(); }
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 34 35 36 37 38 39 40 41 42 43 44 45 | #include <bits/stdc++.h> using namespace std; #define PB push_back #define SZ(x) int((x).size()) #define REP(i, n) for(int i=0,_=(n);i<_;++i) #define FOR(i, a, b) for(int i=(a),_=(b);i<=_;++i) #define FORD(i, a, b) for(int i=(a),_=(b);i>=_;--i) #ifdef DEBUG #define DEB(x) (cerr << x) #else #define DEB(x) #endif typedef long long ll; typedef vector<int> vi; typedef pair<int, int> pii; const int INF = 1e9 + 9; void inline one() { int n, k; cin >> n >> k; int best = INF; REP(i, n) { FOR(j, 0, i) { int x; cin >> x; int required = (j + 1) * (i - j + 1); if (k >= required) { best = min(best, x); } } } cout << best << "\n"; } int main() { ios::sync_with_stdio(false); cin.tie(0); //int z; cin >> z; while(z--) one(); } |