Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- using namespace std;
- ifstream fin ("date.in");
- void S1 (int &n, int x[31][31])
- {
- fin >> n;
- for (int i = 1; i <=n ; i++)
- {
- for (int j = 1 ; j <= n ; j++)
- {
- fin >> x[i][j];
- }
- }
- }
- void S2 (int n, int v[], int &s)
- {
- s = 0;
- for (int i = 1 ; i <= n; i++)
- {
- s += v[i];
- }
- }
- int main()
- {
- int k, n, s, x[31][31], v[31], sol[31], p = 0;
- cin >> k;
- S1 (n, x);
- for (int i = 1 ; i <=n ; i++)
- {
- s = 0;
- for (int j = 1; j <= n ; j++)
- {
- v[j] = x[i][j];
- }
- S2 (n, v, s);
- if (s < k)
- {
- p++;
- sol[p] = i;
- }
- }
- for (int i = 1 ; i < p ; i++)
- {
- for (int j = i + 1; j <= p ; j++)
- {
- if (sol[i] < sol [j])
- {
- int aux = sol[i];
- sol [i] = sol [j];
- sol [j] = aux;
- }
- }
- }
- for (int i = 1 ; i <= p ; i++) cout << sol[i] << ' ';
- fin.close();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement