# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
145568 | 2019-08-20T12:04:07 Z | bharat2002 | Bubble Sort 2 (JOI18_bubblesort2) | C++14 | 0 ms | 0 KB |
/*input */ #include<bits/stdc++.h> using namespace std; const int N=5e5 + 1099; const int mod=1e9 + 7; #define int long long const int inf=1e18; #define pii pair<int, int> #define f first #define s second #define mp make_pair int n, arr[N];map<int, int> conv; signed main() { ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); cin>>n; for(int i=1;i<=n;i++) cin>>arr[i]; int q;cin>>q; while(q--) { int v, k;cin>>v>>k; cout<<10<<endl; } }