Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #define _CRT_SECURE_NO_DEPRECATE
- #include <iostream>
- #include <vector>
- #include <string>
- #include <map>
- #include <set>
- #include <algorithm>
- #define li long long
- using namespace std;
- pair<li, li> t[5001];
- bool cmp(pair<li, li> a, pair<li, li> b) {
- if (a.first * b.second < b.first * a.second) {
- return true;
- }
- return false;
- }
- li gcd(li a, li b) {
- return b ? gcd(b, a % b) : a;
- }
- int main() {
- freopen("input.txt", "r", stdin);
- freopen("output.txt", "w", stdout);
- int k, n;
- cin >> n >> k;
- k--;
- vector <li> a(n), b(n);
- for (int i = 0; i < n; i++) {
- cin >> a[i];
- }
- for (int i = 0; i < n; i++) {
- cin >> b[i];
- }
- for (int j = 0; j < n; j++) {
- int c = 0;
- for (int i = j + 1; i < n; i++) {
- t[c] = { a[c], b[i] };
- c++;
- }
- for (int i = 0; i < j + 1; i++) {
- t[c] = { a[c], b[i] };
- c++;
- }
- sort(t, t + n, cmp);
- li g = gcd(t[k].first, t[k].second);
- cout << t[k].first / g << '/' <<t[k].second / g << ' ';
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement