Submission #223820
Source Code Expand
#include <algorithm> #include <cfloat> #include <climits> #include <cmath> #include <complex> #include <cstdio> #include <cstdlib> #include <cstring> #include <functional> #include <iostream> #include <map> #include <memory> #include <queue> #include <set> #include <sstream> #include <stack> #include <string> #include <utility> #include <vector> using namespace std; #define sz size() #define pb push_back #define mp make_pair #define fi first #define se second #define all(c) (c).begin(), (c).end() #define rep(i,a,b) for(int i=(a);i<(b);++i) #define clr(a, b) memset((a), (b) ,sizeof(a)) #define MOD 1000000007 int main(){ int n,k; cin >> n >> k; vector<int> v; rep(i,0,n){ int a; cin >> a; v.pb(a); } vector<pair<int,int> > p; rep(i,1,v.sz+1){ p.pb(mp(v[i-1],i)); if(i>=k){ sort(all(p)); cout << p[k-1].se << endl; } } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 特別賞 |
User | cls0001011 |
Language | C++ (G++ 4.6.4) |
Score | 40 |
Code Size | 998 Byte |
Status | TLE |
Exec Time | 2033 ms |
Memory | 2340 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 40 / 40 | 0 / 60 | ||||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt |
Subtask1 | sample_01.txt, sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt |
Subtask2 | subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 25 ms | 920 KB |
sample_02.txt | AC | 24 ms | 924 KB |
subtask1_01.txt | AC | 24 ms | 928 KB |
subtask1_02.txt | AC | 23 ms | 676 KB |
subtask1_03.txt | AC | 24 ms | 924 KB |
subtask1_04.txt | AC | 24 ms | 928 KB |
subtask1_05.txt | AC | 55 ms | 804 KB |
subtask1_06.txt | AC | 58 ms | 796 KB |
subtask1_07.txt | AC | 24 ms | 920 KB |
subtask1_08.txt | AC | 35 ms | 804 KB |
subtask1_09.txt | AC | 71 ms | 800 KB |
subtask1_10.txt | AC | 34 ms | 800 KB |
subtask1_11.txt | AC | 70 ms | 812 KB |
subtask2_01.txt | TLE | 2032 ms | 1188 KB |
subtask2_02.txt | AC | 75 ms | 804 KB |
subtask2_03.txt | TLE | 2032 ms | 1948 KB |
subtask2_04.txt | TLE | 2032 ms | 1440 KB |
subtask2_05.txt | AC | 95 ms | 2340 KB |
subtask2_06.txt | TLE | 2033 ms | 1948 KB |
subtask2_07.txt | TLE | 2032 ms | 1940 KB |
subtask2_08.txt | TLE | 2032 ms | 1948 KB |
subtask2_09.txt | TLE | 2033 ms | 1940 KB |