Submission #1496793
Source Code Expand
#include<cstdio> #include<iostream> #include<algorithm> #include<string> #include<queue> #include<vector> #include<functional> #include<cmath> #include<map> #include<stack> #include<set> #include<numeric> #include<limits> #include<iterator> #define all(x) (x).begin(),(x).end() #define rall(x) (x).rbegin(),(x).rend() using namespace std; typedef long long ll; typedef pair<int, int> pi; typedef pair<ll, ll> pl; typedef pair<ll, char> plc; int a, b, c, d; int e[11][11]; bool check(int n) { int pass_p = 0; for (int i = 0; i < c; i++) { int pass = 0; for (int j = 0; j < a; j++) { if (e[i][j] >= n)pass++; } if (pass >= b)pass_p++; } return pass_p >= d; } int main() { cin >> a >> b >> c >> d; for (int i = 0; i < c; i++) { for (int j = 0; j < a; j++) cin >> e[i][j]; } int low = 0, high = 100, mid; while (high-low > 1) { mid = (low + high) / 2; if (check(mid))low = mid; else high = mid; } cout << low << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 成績判定 |
User | jj |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1022 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | basic_case00, basic_case01, basic_case02, basic_case03, basic_case04, basic_case05, basic_case06, basic_case07, basic_case08, basic_case09, sample00 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
basic_case00 | AC | 1 ms | 256 KB |
basic_case01 | AC | 1 ms | 256 KB |
basic_case02 | AC | 1 ms | 256 KB |
basic_case03 | AC | 1 ms | 256 KB |
basic_case04 | AC | 1 ms | 256 KB |
basic_case05 | AC | 1 ms | 256 KB |
basic_case06 | AC | 1 ms | 256 KB |
basic_case07 | AC | 1 ms | 256 KB |
basic_case08 | AC | 1 ms | 256 KB |
basic_case09 | AC | 1 ms | 256 KB |
sample00 | AC | 1 ms | 256 KB |